June 2019 Paper 1 GCE A/L Computer Science - Introduction to GCE A/L 2019 Solution
June 2019 Paper 1 GCE A/L Computer Science: Introduction Topics
Introduction
: 0:00:30 mins
: 0:12:07 mins
Computer Science June 2019 Paper 1 Solutions
: 0:00:30 mins
: 0:12:07 mins
: 0:04:13 mins
: 0:06:16 mins
: 0:10:16 mins
: 0:01:19 mins
: 0:08:22 mins
: 0:01:49 mins
: 0:02:33 mins
: 0:06:02 mins
: 0:01:53 mins
: 0:03:36 mins
: 0:02:44 mins
: 0:02:40 mins
: 0:01:19 mins
: 0:05:00 mins
: 0:00:58 mins
: 0:01:14 mins
: 0:02:17 mins
: 0:01:06 mins
: 0:03:18 mins
: 0:03:09 mins
: 0:05:37 mins
: 0:01:19 mins
: 0:02:02 mins
: 0:03:29 mins
: 0:01:09 mins
: 0:01:02 mins
: 0:03:40 mins
: 0:01:21 mins
: 0:02:02 mins
: 0:04:36 mins
: 0:01:28 mins
: 0:01:34 mins
: 0:00:23 mins
: 0:01:23 mins
: 0:05:14 mins
: 0:01:39 mins
: 0:02:48 mins
: 0:01:42 mins
: 0:00:55 mins
: 0:01:29 mins
: 0:01:56 mins
: 0:00:56 mins
: 0:01:42 mins
: 0:00:37 mins
: 0:03:55 mins
Hello everyone. Today's class will take place on the platform. It will be a question and answer session. I will ask past question and I will be expecting an answer from you all.
NB: no answer is wrong. So don't be shy to answer because you think your answer is wrong
What is meant by bound un the analysis of algorithms ?
Hello Vanessa I just saw your problem. The Lower and Upper Bound Theory provides a way to find the lowest complexity algorithm to solve a problem
excuse me sir, when you say lowest complexity do you mean the minimum time and smallest storage space to solve a problem ?
Hello everyone. A video will soon be uploaded for those who didn't attend the class on the 20th of February. In the last video, an assignment has been given(Study selection sort and write out the corresponding algorithm). Please watch the video and endeavor to do the assignment before the next class.
NB:Even those who attended the class should watch the video and do the asssignment.
In data transmission, what is a parity bit? How does one detect errors during data transmission?
Thanks for the question sir
very interesting Question Sir Frank,