The full Cambridge International AS & A Level Computer Science course, AS and A Level: how data, hardware, networks, operating systems and security work, plus algorithms, data structures, databases, programming paradigms, recursion and artificial intelligence.
Lesson 1 is free to try. The other 179 lessons in Computer Science and its exam practice are for schools on RudimentaryLabs.
How binary encodes numbers, text, images and sound, and how files are made smaller.
How networks and the internet are built, addressed and used to move data.
The parts of a computer system, how key devices work, memory types, control systems and logic circuits.
How the CPU fetches and runs instructions, and how assembly language and bit manipulation work.
What an operating system and utilities do, and how programs are translated and developed.
Keeping systems and data safe from threats, and checking that data is correct.
Acting ethically as a computing professional, copyright, software licences and the impact of AI.
Relational databases, their design and normalisation, the DBMS, and SQL.
Abstraction, decomposition and the ways of writing down algorithms: pseudocode, structured English and flowcharts.
Choosing data types, records, arrays, text files and abstract data types such as stacks, queues and linked lists.
Writing pseudocode programs with variables, selection, loops, procedures and functions.
Life cycles, program design with structure charts and state-transition diagrams, testing and maintenance.
User-defined data types, file organisation and hashing, and floating-point numbers.
Protocols, the TCP/IP stack and how circuit and packet switching carry data.
RISC and CISC processors, parallel architectures, virtual machines, and Boolean algebra for circuits.
How an operating system manages processes and memory, and how compilers and interpreters translate code.
Encryption, secure connections with SSL/TLS, and digital signatures and certificates.
Graph search with Dijkstra's and A*, neural networks and the main types of machine learning.
Searching and sorting algorithms, abstract data types, Big O notation and recursion.
Programming paradigms (low-level, procedural, object-oriented, declarative), file processing and exception handling.