// Courses & syllabuses

Every major board, one expert teacher

Below is what each course covers — the official syllabus topic areas. Full lessons, notes, worked examples and topical past papers are provided when you enrol.

CAMBRIDGE · CIE 9618

A-Level Computer Science

AS + A2 · Papers 1–4 (theory + problem-solving + programming)

The flagship A-Level for university computing. Deep theory paired with practical programming in Python, VB.NET or Java.

Information representation (number systems, images, sound)
Communication & internet technologies
Hardware & logic gates
Processor fundamentals & assembly
System software & the OS
Security, privacy & data integrity
Ethics & ownership
Databases & SQL
Algorithm design & problem-solving
Data types & data structures (stacks, queues, trees, linked lists)
Programming & recursion
Software development life cycle
Boolean algebra & Karnaugh maps
Computational thinking & OOP
OXFORD AQA

A-Level Computer Science (AQA)

Theory papers + on-screen programming + NEA project

Rigorous and globally recognised, with a strong focus on theory of computation and a substantial coding project.

Fundamentals of programming & OOP
Fundamentals of data structures
Fundamentals of algorithms
Theory of computation (FSMs, Turing machines)
Data representation & databases
Computer systems & hardware
Networking & the internet
Big Data & functional programming
Boolean algebra
Non-Exam Assessment (programming project)
CAMBRIDGE · 0478 / 0984

IGCSE Computer Science

Paper 1 (theory) + Paper 2 (algorithms & programming)

A strong launchpad — builds computational thinking and your first real programming skills.

Data representation (binary, hex, compression)
Data transmission & error checking
Hardware & logic gates
Software & the operating system
The internet & cyber security
Automated & emerging technologies
Algorithm design & problem-solving
Programming concepts (Python / pseudocode)
Databases (single-table)
Boolean logic
CAMBRIDGE · 2210

O-Level Computer Science

Paper 1 (theory) + Paper 2 (problem-solving & programming)

Equivalent depth to IGCSE, focused on core CS theory and clear exam technique.

Data representation
Communication & network technologies
Hardware & software
Security & ethics
Algorithm design (flowcharts & pseudocode)
Programming & testing
Databases
Logic gates & Boolean logic
EDEXCEL · PEARSON

Edexcel IGCSE / GCSE Computer Science

Written paper + practical programming (Python)

Pearson Edexcel's CS pathway with a strong practical programming component.

Problem-solving & decomposition
Programming in Python
Data & binary representation
Computers & hardware
Networks & the internet
Issues & impact (legal, ethical, environmental)
Algorithms (search & sort)
Validation, testing & debugging
COLLEGE BOARD · AP

AP Computer Science (A & Principles)

AP CS A (Java) · AP CS Principles + Create Performance Task

College-level credit. CS A is a deep Java course; CS Principles is broader and concept-focused.

AP CS A: primitive types & objects
Boolean expressions & if-statements
Iteration & the String class
Writing classes & methods
1-D arrays, ArrayList & 2-D arrays
Inheritance & recursion
AP CSP: creative development & data
Algorithms & programming (incl. abstraction)
Computer systems & networks
Impact of computing + Create Task
IB DIPLOMA · SL / HL

IB DP Computer Science

SL & HL core + HL extension + Internal Assessment (+ HL case study)

A balanced, theory-rich diploma course with a substantial solution-development Internal Assessment.

System fundamentals
Computer organisation
Networks
Computational thinking, problem-solving & programming
Abstract data structures (HL)
Resource management (HL)
Control (HL)
Option: Databases / OOP / Web science / Modelling
Internal Assessment (the solution)
HL annual case study

Ready to enrol?

Tell us your board and level — we'll set up your course, schedule and resources.

Register now →
Syllabus topic areas shown are from official exam-board specifications. Full teaching notes & materials are provided on enrolment.