Paper 1 Video Solutions - CSC A/L - Introduction to GCE A/L 2019 Solution
Paper 1 Video Solutions - CSC A/L: Introduction Topics
Introduction
: 0:00:30 mins
: 0:12:07 mins
Solutions To GCE A/L 2019
: 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

2nd Year AT THE NATIONAL ADVANCED SCHOOL OF ENGINEERING YAOUNDE
A PDF with the questions will be uploaded at the end of the class due to some technical issues. The class continues via a zoom meeting.
erros are detected by means of a parity check
Parity check is the use of bits to check that is transmitted accurately
erros are detected by means of a parity check
Yes, errors are detected using a parity check, but what is a parity check?
You will have to add some weight to this answer by explaining what a parity check is
a parity bit is a bit that is added to a string of codes
That's good. But in the gce, you will be expected to give more details while answering. We are in the advanced level, and we will be expected to answer questions like advanced people
a parity bit is a bit that is added to a string of codes
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.