Cambridge AS & A Level Computer Science
AA Level subject content
Overview
Topics 13-20: A Level only; Paper 3 examines topics 13-20 and Paper 4 practically examines topics 19-20 (except low-level and declarative programming), with AS content assumed.
In this topic
Lessons
- Full access
Binary search and insertion sort
60 min
- Full access
Binary trees and their algorithms
65 min
- Full access
Comparing algorithms and Big O notation
55 min
- Full access
Graphs, dictionaries and implementing ADTs
55 min
- Full access
Linked list algorithms
60 min
- Full access
Stack and queue algorithms
60 min
- Full access
Graphs and path finding: Dijkstra's algorithm and A*
60 min
- Full access
Machine learning: neural networks, deep learning and regression
60 min
- Full access
Encryption: symmetric and asymmetric keys
55 min
- Full access
SSL/TLS, digital certificates and digital signatures
55 min
- Full access
Parallel processing and computer architectures
40 min
- Full access
RISC and CISC processors and pipelining
45 min
- Full access
Virtual machines
35 min
- Full access
Declarative programming: facts, rules and goals
55 min
- Full access
Object-oriented programming: classes, objects, inheritance and polymorphism
55 min
- Full access
Programming languages and paradigms
45 min
- Full access
Writing object-oriented programs
60 min
- Full access
Application-layer protocols: HTTP, FTP, SMTP, POP3, IMAP and BitTorrent
50 min
- Full access
The OSI model and the TCP/IP protocol stack
55 min
- Full access
Memory management: paging, segmentation and virtual memory
60 min
14 more lessons in this topic. Join to read every lesson, or see what Full access includes.
Sample question
A sample question on this topic. Answer it, check it, then read the worked answer.
Turn A Level subject content into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.