A Level Computer Science - A Level
A Level Computer Science Paper 1
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
Original practice sets for A Level Computer Science, drawn from our own question bank. Each has a stable link, a printable PDF and a full worked mark scheme.
A Level Computer Science - A Level
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
A Level Computer Science - A Level
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
A Level Computer Science - A Level
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
A Level Computer Science - A Level
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
A Level Computer Science - A Level
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 3 more.
A Level Computer Science - A Level
Covers Data Representation, Computer Architecture and the CPU, Networks and Communication and 3 more.
The papers above are scoped by grade band. These are scoped by teaching point instead: each one leaves out content a student at that stage has not met yet, so a mock in the middle of the course tests what has actually been covered.
AS and A Level are separate qualifications with different assessed content, so this split follows the specification rather than a teaching convention. I'm confident in the seven AS topics as a genuinely prerequisite-free core, and in databases-sql, data-structures-nonlinear and programming-paradigms as needing that core first, but I'm less certain of the exact boundary for two topics: algorithm-complexity, since some specifications introduce a light form of Big O alongside AS-level searching/sorting rather than saving it entirely for year two; and theory-of-computation, since AS students are typically still assessed on basic finite state machines even though the harder content this bank likely tests (Turing machines, computability, the halting problem) is genuinely A2-only - both are placed as A2-only here on balance of evidence, not certainty. I'm also reasoning from the general shape shared by AQA and OCR rather than one named board's syllabus, since these topic ids aren't tied to specific board numbering, and OCR structures its "exchanging data" and "algorithms" sections differently enough from AQA that a bank built strictly to OCR's AS (H046) boundary could draw one or two of these lines slightly differently.
A Level Computer Science - AS
Covers data representation, boolean logic and logic gates, computer architecture, linear data structures such as stacks and queues, and writing and tracing short programs.
A Level Computer Science - AS
Covers computer architecture, networks and how computers communicate, data representation, boolean logic and logic gates, and searching and sorting algorithms.
A Level Computer Science - AS
Covers linear data structures such as stacks, queues and linked lists, searching and sorting algorithms, writing and tracing short programs, data representation and computer architecture.
A Level Computer Science - AS
A mixed paper covering data representation, boolean logic and logic gates, computer architecture, networks, linear data structures and searching and sorting algorithms.
A Level Computer Science - AS
A second mixed paper covering boolean logic and logic gates, computer architecture, networks, linear data structures, searching and sorting algorithms and writing and tracing short programs.
A Level Computer Science - AS
A full review paper covering every AS topic: data representation, boolean logic and logic gates, computer architecture, networks, linear data structures, searching and sorting algorithms and writing and tracing short programs.
A Level Computer Science - A Level
Covers linear data structures, trees and graphs, searching and sorting algorithms, algorithmic complexity, and writing and tracing programs.
A Level Computer Science - A Level
Covers programming paradigms, the theory of computation, searching and sorting algorithms, writing and tracing programs, and algorithmic complexity.
A Level Computer Science - A Level
Covers data representation, computer architecture, networks, boolean logic and logic gates, and databases and SQL.
A Level Computer Science - A Level
Covers data representation, networks, databases and SQL, boolean logic and logic gates, trees and graphs, and searching and sorting algorithms.
A Level Computer Science - A Level
Covers trees and graphs, algorithmic complexity, programming paradigms, the theory of computation, searching and sorting algorithms, and writing and tracing programs.
A Level Computer Science - A Level
A wide-ranging review paper covering linear data structures, computer architecture, data representation, networks, databases and SQL, boolean logic and logic gates, programming paradigms and the theory of computation.