AQA A-Level Computer Science (Paper 1) Mock Test

Exam Overview

The AQA A-Level Computer Science Paper 1 (specification code 7517/1) is a specialized on-screen examination designed to assess practical programming ability, computational problem-solving, and core computer science theoretical fundamentals. Unlike traditional written examinations, Paper 1 requires students to work directly in an Integrated Development Environment (IDE) on a computer to write, debug, and modify functional code.

Paper 1 accounts for 40% of the total A-Level qualification and carries a total of 100 marks. Candidates are assessed using one of four approved programming languages: Python (Python 3), C#, Java, or Visual Basic (.NET). A defining feature of Paper 1 is the inclusion of the Preliminary Material—a comprehensive skeleton program and accompanying design documentation released by AQA several months prior to the exam series. During the exam, students answer questions relating directly to this codebase as well as independent theoretical and algorithmic questions.

Detailed Syllabus & Key Topics

The curriculum for AQA Paper 1 bridges theoretical computational thinking and practical programming implementation across several core units:

1. Fundamentals of Programming

• Core Constructs: Variables, constants, sequence, selection (if/else, switch/case), iteration (count-controlled and condition-controlled loops).
• Subroutines: Functions, procedures, parameters passed by value and reference, variable scope (local vs. global), return values.
• Recursion: Mechanics of recursive subroutines, base cases, call stacks, and recursive trace tables.
• Object-Oriented Programming (OOP): Classes, objects, instantiation, encapsulation, inheritance, polymorphism, overriding, and aggregation vs. composition.

2. Fundamentals of Data Structures

• Primitive & Composite Structures: Arrays, two-dimensional matrices, records, and strings.
• Dynamic Abstract Data Types: Stacks (LIFO), queues (FIFO, circular, and priority queues), singly and doubly linked lists, hash tables, and collision handling.
• Non-Linear Data Types: Binary search trees, directed/undirected graphs, adjacency matrices, and adjacency lists.

3. Fundamentals of Algorithms

• Search Algorithms: Linear search, binary search, binary tree searches.
• Sorting Algorithms: Bubble sort, insertion sort, merge sort, and quicksort.
• Graph Algorithms: Breadth-first search (BFS), depth-first search (DFS), and Dijkstra’s shortest path algorithm.
• Tree Traversals: Pre-order, in-order, post-order tree walking algorithms.
• Algorithm Efficiency: Evaluating time and space complexity using Big-O notation ($O(1)$, $O(\log n)$, $O(n)$, $O(n \log n)$, $O(n^2)$, $O(2^n)$).

4. Theory of Computation

• Formal Languages & Automata: Finite State Machines (FSMs) with and without output (Mealy and Moore machines), state transition tables, and transition diagrams.
• Grammars and Syntax: Regular languages, regular expressions, Backus-Naur Form (BNF), and syntax diagrams.
• Turing Machines: Principles of Universal Turing Machines, transition functions, halting state, and computable functions.
• Maths for Computation: Reverse Polish Notation (RPN), infix to postfix conversion, and Boolean algebra.

5. Skeleton Program and Scenario Tasks

• Deep analysis of the pre-released skeleton program provided by AQA.
• Writing modular extensions, creating validation routines, implementing game mechanics, and fixing intentional syntax/runtime bugs under exam conditions.

Assessment Format & Test Rules

• Duration: 2 hours 30 minutes (150 minutes).
• Mode: Computer-based on-screen assessment in a secure computer lab.
• Total Marks: 100 marks (worth 40% of the overall A-Level grade).
• Answer Format: Candidates type answers and paste code snippets/screenshots of program execution into an Electronic Answer Document (EAD) supplied by the exam centre.
• Environment: Candidates must have access to a clean computer terminal with an approved IDE and offline compiler/interpreter. Internet access, external USB drives, and unauthorized electronic devices are strictly prohibited.

Scoring System and Grade Boundaries

Paper 1 is marked out of 100 raw marks by AQA external examiners. Marks are awarded for theoretical answers, accurate syntax, logical structure, modular programming, and clear evidence of testing (such as required input/output screenshots showing specific test runs requested in the paper).

Raw marks from Paper 1 are combined with Paper 2 (100 marks, 40%) and the Non-Exam Assessment / Coursework project (75 marks, 20%) to yield the overall qualification grade from A* down to E. Grade boundaries vary each exam year depending on cohort performance, but historically:

• A:* Approximately 72–80% of raw marks
• A: Approximately 62–70% of raw marks
• B: Approximately 52–60% of raw marks
• C: Approximately 43–50% of raw marks
• D/E: Below 42%

Preparation & Revision Strategies

1. Master the Skeleton Program: Annotate every line of the pre-release codebase. Create mock extensions, identify potential edge cases, and practice implementing anticipated feature requests.
2. Drill Standard Data Structures: Be ready to code a linked list, stack, or binary search tree from scratch without relying on built-in language library helpers.
3. Practice Time Management: Spend no more than 60–70 minutes on the skeleton program questions, reserving adequate time for theory, trace tables, and general programming tasks.
4. Refine Screenshot and Testing Technique: Ensure program outputs are clearly formatted and captured exactly as instructed in the paper to avoid forfeiting easy execution marks.