Y13
Dates & Time:
Mondays: 11:40-12:35
Tuesdays: 09:35-11:40
Thursdays: 08:40-10:30
Fridays: 09:35-10:30
ACTIVITIES:
Learn about user defined types (Course book and video in Lesson Resources)
Learn about floating point numbers (Course book and video in Lesson Resources)
Start with past paper topical questions for UNIT 13
LESSON RESOURCES:
ACTIVITIES:
Read about CISC vs RISC (see Lesson Resources)
Read about SISD, SIMD, MISD, MIMD (see Lesson Resources)
Read about Massively Parallel Systems (see Lesson Resources)
Do the Sheet on Boolean Algebra (see Lesson Resources)
Watch video on K-Maps (see Lesson Resources)
LESSON RESOURCES:
ACTIVITIES:
Look at Bubble Sort video (see Resources)
Look at Insertion Sort video (see Resources)
Look at Merge Sort video (see Resources)
Look at Big O Notation and Time / Space Complexity
Look at Visualization of 24 Sorting Algorithms In 2 Minutes video (until min 1:05 see Resources)
Time Complexity: refers to the growth in the number of instructions executed (and therefore the time taken) as the length of the array to be searched increases.
Space Complexity: refers to the growth in the size of memory space that is required as the length of the array is increased.
Note: Two algorithms can have the same Big O notation but in practice have wildly different execution times in practice. This is because the Big O describes the growth rate of complexity, not the actual complexity itself.
Look at Big O Cheat Sheet
Look at 'How Binary Search Makes Computers Much, Much Faster' video (see Resources)
LESSON RESOURCES:
[VIDEO]: Visualization of 24 Sorting Algorithm [UNTIL MIN 1:05]
[VIDEO]: How Binary Search Makes Computers Much, Much Faster
ACTIVITIES:
Do PAPER 41 FROM OCT/NOV 2022: Q1, Q3
Follow along with the walkthrough (see resources)
Do PAPER 42 FROM OCT/NOV 2022: Q1, Q3
Follow along with the walkthrough (see resources)
Do PAPER 42 FROM OCT/NOV 2021: Q3
Follow along with the walkthrough (see resources)
Do PAPER 41 FROM MAY/JUN 2021: Q3
Follow along with the walkthrough (see resources)
After this you can attempt another paper yourself
LESSON RESOURCES:
[WALKTHROUGH]: COMPUTER SCIENCE 9618/41 Paper 4 Practical October/November 2022 2 hours 30 minutes
[WALKTHROUGH]: COMPUTER SCIENCE 9618/42 Paper 4 Practical October/November 2022 Q3 Queue
[WALKTHROUGH]: COMPUTER SCIENCE 9618/42 Paper 4 Practical October/November 2021 Q3 Linked List
ACTIVITIES:
Go through OOP presentation (see Lesson Resources)
LESSON RESOURCES:
ACTIVITIES:
Go through Prolog basics in the book.
Try the tutorial on Excercism (for account creation no personal data is needed other than school email)
LESSON RESOURCES:
ACTIVITIES:
Try a complete Paper 4. Now having done OOP and Declarative and Low-Level Programming you should be able to do the complete paper
LESSON RESOURCES:
ACTIVITIES:
Go through the explanation video (see Lesson Resources) for UNIT 14.
Start on the Topical Past Paper questions for UNIT 14 (see Resources > UNIT 14)
LESSON RESOURCES:
ACTIVITIES:
Go through the explanation video (see Lesson Resources) for Dijkstra's algorithm.
Go through the explanation video (see Lesson Resources) for the A* algorithm.
Go through the explanation video (see Lesson Resources) for Unit 18 Artificial Intelligence.
Start on the Topical Past Paper questions for UNIT 18 (see Resources > UNIT 18)
LESSON RESOURCES:
ACTIVITIES:
Go through the explanation video (see Lesson Resources) for 'How Does a Quantum Computer Work?' .
Go through the explanation video (see Lesson Resources) for the 'Quantum Computers, explained with MKBHD'.
Go through the explanation video (see Lesson Resources) for Unit 17 Security.
Start on the Topical Past Paper questions for UNIT 17 (see Resources > UNIT 17)
LESSON RESOURCES:
ACTIVITIES:
Go through Cambridge Course Book Chapter 20 "System Software".
Go through the explanation video (see Lesson Resources) for 'A-Level Computer Science (9618) - U16 - System Software' .
Start on the Topical Past Paper questions for UNIT 16 (see Resources > UNIT 16)
LESSON RESOURCES:
Understanding the Concepts
Private Key: A secret key used for decryption in asymmetric encryption. It is never shared and has a corresponding public key.
Public Key: A key that can be shared publicly and is used for encryption in asymmetric encryption.
Digital Signature: A cryptographic value that is calculated from the data and a secret key, used to verify the authenticity and integrity of a message.
Structuring Your Answers
Define Key Terms: Start by clearly defining any key terms mentioned in the question.
Describe Processes: When asked to describe a process, break it down into clear, logical steps.
Explain Usage: Explain how and why certain cryptographic methods are used, focusing on their purpose and benefits.
Provide Examples: Where possible, provide examples to illustrate your points.
Question 1: Private Key
Question: State what is meant by a private key. Answer:
Definition: A private key is a secret key that is not shared or transmitted.
Matching Public Key: It has a corresponding public key.
Decryption: Used to decrypt data encrypted with its matching public key.
Question 2: Asymmetric Encryption Process
Question: Describe the process of asymmetric encryption. Answer:
Encryption: The message is encrypted using the recipient’s public key.
Decryption: The message is decrypted using the recipient’s private key.
Question 3: Digital Signature Verification
Question: Explain how a digital signature is used to verify a message when it is received. Answer:
Decryption: The message and digital signature are decrypted using the receiver’s private key.
Signature Decryption: The digital signature is decrypted with the sender’s public key to get the message digest.
Hashing: The received message is hashed to reproduce the message digest.
Comparison: Compare the two message digests to check for alterations.
Question 4: Data Items in a Digital Certificate
Question: Name three data items present in a digital certificate. Answer:
Serial Number: Unique identifier for the certificate.
Certificate Authority (CA): The entity that issued the certificate.
Public Key: The public key of the certificate owner.
Question 5: Issuing a Digital Certificate
Question: State the correct word and justify your choice for the missing words in the method of issuing a digital certificate. Answer:
(i) Public: The generated public key is sent to the CA.
(ii) Public: The key and data are encrypted using the CA’s public key.
(iii) Private: The CA signs the digital document using its private key.
Question 6: Email Security
Question: Explain how Beena can be sure that she has received a message that is authentic and from Alexa. Answer:
Digital Signature: The name given to the encrypted message digest.
Verification: Beena can verify the message by using Alexa’s public key from the digital certificate to decrypt the message digest and compare it with the hash of the received message. If they match, the message is authentic and from Alexa.
Be Concise: Stick to the key points.
Use Technical Terms: Correctly use terms like "private key," "public key," "encryption," "decryption," "message digest," and "digital signature."
Structure Your Answer: Clearly separate each point for clarity.
Provide Justifications: When asked to justify, explain the reasoning behind your answers.