A Level Computer Science Paper 1
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
A Level Computer Science
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.
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 9 more.
Covers Linear Data Structures, Trees and Graphs, Searching and Sorting Algorithms and 3 more.
Covers Data Representation, Computer Architecture and the CPU, Networks and Communication and 3 more.
Covers data representation, boolean logic and logic gates, computer architecture, linear data structures such as stacks and queues, and writing and tracing short programs.
Covers computer architecture, networks and how computers communicate, data representation, boolean logic and logic gates, and searching and sorting algorithms.
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 mixed paper covering data representation, boolean logic and logic gates, computer architecture, networks, linear data structures and searching and sorting algorithms.
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 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.
Covers linear data structures, trees and graphs, searching and sorting algorithms, algorithmic complexity, and writing and tracing programs.
Covers programming paradigms, the theory of computation, searching and sorting algorithms, writing and tracing programs, and algorithmic complexity.
Covers data representation, computer architecture, networks, boolean logic and logic gates, and databases and SQL.
Covers data representation, networks, databases and SQL, boolean logic and logic gates, trees and graphs, and searching and sorting algorithms.
Covers trees and graphs, algorithmic complexity, programming paradigms, the theory of computation, searching and sorting algorithms, and writing and tracing programs.
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.
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.
Pick the topics, add the student's name and print one PDF.