Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

A Level Computer Science

Practice papers with model solutions

Original practice papers from our own question bank, each with a full model-solution mark scheme.

Prefer to work in your A Level workspace? Open A Level Computer Science mock papers.

Papers by grade band

6 papers
A Level

A Level Computer Science Paper 1

Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.

16 questions · 60 marks

A Level

A Level Computer Science Paper 2

Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.

18 questions · 60 marks

A Level

A Level Computer Science Paper 3

Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.

15 questions · 60 marks

A Level

A Level Computer Science Paper 4

Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.

16 questions · 60 marks

A Level

A Level Computer Science Short Paper A

Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 3 more.

10 questions · 40 marks

A Level

A Level Computer Science Short Paper B

Covers Data Representation, Computer Architecture and the CPU, Networks and Communication and 3 more.

13 questions · 40 marks

Papers scoped to what has been taught

AS6 papers

AS

AS Paper 1: Data Representation and Logic

Covers data representation, boolean logic and logic gates, computer architecture, linear data structures such as stacks and queues, and writing and tracing short programs.

19 questions · 60 marks

AS

AS Paper 2: Networks and Systems

Covers computer architecture, networks and how computers communicate, data representation, boolean logic and logic gates, and searching and sorting algorithms.

17 questions · 60 marks

AS

AS Paper 3: Algorithms and Structures

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.

16 questions · 60 marks

AS

AS Paper 4: Mixed Practice A

A mixed paper covering data representation, boolean logic and logic gates, computer architecture, networks, linear data structures and searching and sorting algorithms.

22 questions · 80 marks

AS

AS Paper 5: Mixed Practice B

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.

24 questions · 80 marks

AS

AS Paper 6: Full AS Review

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.

28 questions · 100 marks

How the AS and A Level split is drawn

AS and A Level are separate qualifications with different assessed content, so this split follows the specification.

The seven AS topics form a core with no prerequisites, and databases and SQL, non-linear data structures and programming paradigms build on that core. The boundary is least certain for two topics. Algorithm complexity is placed in the second year, but some specifications introduce a light form of Big O alongside AS searching and sorting. The theory of computation is also placed in the second year: AS students are often still assessed on basic finite state machines, although the harder content (Turing machines, computability and the halting problem) is A Level only. This split reflects the general shape shared by AQA and OCR rather than one named board, and OCR organises its data exchange and algorithms sections differently enough that a strictly OCR-based AS split could draw one or two lines elsewhere.

Keep going

Build a free practice pack.

Pick the topics, add the student's name and print one PDF.