AQA Paper Structure & Question Types

This lesson is your definitive guide to understanding how the AQA GCSE Computer Science exam is structured. Knowing the structure of each paper, the types of questions you will face, and what the examiners are looking for is just as important as knowing the content itself. Students who understand the paper format consistently perform better because they manage their time effectively and answer in the way that earns maximum marks.

The Two Papers at a Glance

AQA GCSE Computer Science (specification code 8525) is assessed through two written exam papers. There is no coursework, no controlled assessment, and no practical endorsement — your entire grade comes from these two exams.

Feature	Paper 1	Paper 2
Title	Computational Thinking and Programming Skills	Computing Concepts
Duration	1 hour 45 minutes	1 hour 45 minutes
Total marks	80	80
Weighting	50% of GCSE	50% of GCSE
Focus	Practical coding, problem solving, algorithms	Theory, systems, data, networks, security, ethics
Style	Code writing, trace tables, algorithm design	Knowledge recall, application, analysis

Key Point: Both papers carry equal weight. You cannot afford to neglect either one. Some students focus heavily on programming and underperform on Paper 2 theory, or vice versa.

Paper 1: Computational Thinking and Programming Skills

What Paper 1 Covers

Paper 1 tests your ability to think computationally and write, read, trace, and debug code. The specification topics assessed on Paper 1 are:

Computational thinking — decomposition, abstraction, algorithmic thinking
Problem solving — designing solutions, structured approaches
Pseudocode and Python — reading, writing, and tracing code in both
Algorithms — searching (linear, binary), sorting (bubble, merge, insertion)
Logic and decision making — selection, iteration, Boolean conditions
Data types and structures — integers, reals, Booleans, characters, strings, arrays/lists

Question Types on Paper 1

Paper 1 uses a wide variety of question types. Here is what to expect:

Short Answer Questions (1–3 marks)

These ask you to state, identify, or give a definition, purpose, or example. They require concise, precise answers.

Example: "State what is meant by the term 'variable'." (1 mark) Good answer: "A named location in memory that stores a value which can change during program execution."

Trace Table Questions (3–6 marks)

You are given a piece of pseudocode or Python and asked to complete a trace table showing how variable values change as the code executes.

Example layout:

Step	x	y	output
1	5	3
2	5	8
3			8

Exam Tip: Always work through the code line by line, updating only the variable that changes on each line. Never skip ahead or try to do it in your head — write every step down. If you make an error early on, you can still earn error-carried-forward (ECF) marks for subsequent rows that are consistent with your mistake.

Code Writing Questions (4–8 marks)

You are given a scenario and asked to write a complete program or subroutine in Python or AQA pseudocode. Marks are typically awarded for:

Correct syntax (brackets, colons, indentation in Python)
Correct logic (the code does what is asked)
Correct output (produces the expected result)
Appropriate use of data structures (arrays, variables)
Use of validation where specified

Example: "Write a Python program that asks the user to enter 10 numbers and outputs the largest number entered." (5 marks)

Code Analysis Questions (2–5 marks)

You are given a piece of code and asked to:

State what it does
Identify errors (syntax, logic, or runtime)
Predict the output for given inputs
Explain why a particular line is needed

Algorithm Design Questions (4–8 marks)

You may be asked to design an algorithm (in pseudocode or flowchart form) to solve a given problem. These questions test your ability to:

Decompose a problem
Use appropriate constructs (sequence, selection, iteration)
Handle edge cases
Apply abstraction

AQA's Reference Language: Python

AQA uses Python as its reference programming language. This means:

All code examples in the exam paper will be in Python or AQA pseudocode
You can answer code writing questions in either Python or AQA pseudocode
If you use Python, examiners expect correct Python syntax
If you use pseudocode, you must follow AQA's pseudocode conventions (covered in Lesson 2)

Exam Tip: Most students find it easier to write in Python because they have practised it throughout the course. However, pseudocode is more forgiving of minor syntax errors. Choose whichever you are most confident with and be consistent.

Paper 2: Computing Concepts

What Paper 2 Covers

Paper 2 tests your theoretical knowledge of computing concepts. The specification topics assessed on Paper 2 are:

Systems architecture — CPU components (ALU, CU, registers), fetch-decode-execute cycle, Von Neumann architecture
Memory — RAM, ROM, virtual memory, cache, flash
Storage — magnetic, optical, solid-state; capacity, speed, cost, durability, portability
Wired and wireless networks — types, topologies (star, mesh), protocols, layers
Network security — threats (malware, phishing, SQL injection, brute force) and prevention (firewalls, encryption, authentication)
Systems software — operating systems, utility software
Ethical, legal, and environmental issues — Data Protection Act, Computer Misuse Act, Copyright, Designs and Patents Act, environmental impact, privacy, digital divide
Data representation — binary, hexadecimal, denary conversions, binary arithmetic, character encoding (ASCII, Unicode), image and sound representation, compression
Boolean logic — truth tables, logic gates (AND, OR, NOT, XOR, NAND, NOR), Boolean expressions, simplification

Question Types on Paper 2

Paper 2 is predominantly knowledge-based but includes application questions too:

Recall Questions (1–2 marks)

"State two purposes of the operating system." or "Give one example of optical storage."

Application Questions (2–4 marks)

"A school is choosing between a star topology and a mesh topology for its network. Compare these two topologies." — You must apply your knowledge to a specific scenario.

Calculation Questions (2–4 marks)

Binary/hex conversions, file size calculations for images and sound. Always show your working — method marks are available even if your final answer is wrong.

Extended Writing Questions (4–6 marks)

"Discuss the ethical issues surrounding the collection and use of personal data by social media companies." — These require structured, balanced arguments with a clear conclusion.

AQA Command Words

Understanding command words is critical. Each command word tells you exactly what the examiner expects:

Command Word	What It Requires	Marks Usually
State	Give a brief, factual answer — no explanation needed	1
Identify	Name or select the correct item from a list or scenario	1
Give	Provide an example, reason, or fact — concise answer	1
Describe	Set out the main characteristics or features — say what happens, step by step	2–4
Explain	Give reasons — say what happens AND why it happens	2–4
Compare	Identify similarities AND differences between two things	2–4
Evaluate	Weigh up evidence, consider pros and cons, reach a supported conclusion	4–6
Design	Create an algorithm, plan, or solution to a problem	4–8
Write	Write code (Python or pseudocode) to solve a given problem	3–8
Complete	Fill in missing parts — usually a trace table, truth table, or partial code	2–6

Critical Exam Tip: If a question says "Explain", you must give reasons (use "because", "this means that", "as a result"). If it says "Describe", you only need to say what happens, not why. Getting this wrong is one of the most common ways students lose marks.

The Difference Between "Describe" and "Explain"

This distinction is worth understanding in detail because it catches out many students every year.

Describe: Say what happens, step by step, feature by feature.

"Describe how binary search works."
Good answer: "The middle element of the sorted list is found. If it matches the search value, the search ends. If the search value is smaller, the upper half is discarded. If larger, the lower half is discarded. The process repeats on the remaining half until the value is found or the list is empty."

Explain: Say what happens AND give reasons why.

"Explain why binary search is more efficient than linear search for large datasets."
Good answer: "Binary search eliminates half the remaining data with each comparison, giving it O(log n) time complexity. This means that doubling the dataset size only adds one extra comparison. Linear search checks each item one by one, giving O(n) complexity, which means doubling the dataset doubles the search time."

Assessment Objectives

AQA allocates marks across three assessment objectives. Understanding these helps you see what the examiners are really testing:

Assessment Objective	Description	% of Total GCSE
AO1 — Demonstrate knowledge and understanding	Recall facts, definitions, concepts	35%
AO2 — Apply knowledge and understanding	Use what you know in familiar and unfamiliar contexts	40%
AO3 — Analyse and evaluate	Make judgements, weigh evidence, solve problems	25%

What This Means in Practice

AO1 (35%): Around a third of marks are for straightforward recall. Learn your definitions, key facts, and terminology precisely.
AO2 (40%): The largest chunk of marks is for application. This means you will be given scenarios, code, data, or problems and asked to apply what you know. You cannot rely solely on memorisation.
AO3 (25%): A quarter of marks require higher-order thinking — evaluating trade-offs, analysing algorithms, debugging code, designing solutions.

Strategic Insight: Because AO2 + AO3 together account for 65% of marks, the exam heavily rewards students who can apply and analyse, not just recall. Practise with past papers and unfamiliar problems, not just flashcards.

Paper 1 vs Paper 2: The Shift in Skills

Understanding the fundamental difference between the two papers will help you revise more effectively:

Aspect	Paper 1	Paper 2
Primary skill	Problem solving and coding	Knowledge recall and application
Revision style	Practice writing code, tracing algorithms, solving problems	Learn facts, practise calculations, write structured answers
Time pressure	Can be tight — code writing takes time	Generally more manageable if you know the content
Common pitfall	Running out of time on long coding questions	Not being precise enough with technical terminology
Key advice	Plan before you code; read the question carefully	Use exact terms; show all working in calculations

Time Management Strategy

With 80 marks in 105 minutes, you have approximately 1 minute and 19 seconds per mark. Here is a practical approach:

Read the entire paper first (2–3 minutes) — get an overview, spot questions you find easy or hard
Answer easy questions first — build confidence and secure marks
Allocate time proportionally — a 6-mark question deserves ~8 minutes; a 1-mark question deserves ~1 minute
Leave 5 minutes at the end to check your work, especially trace tables and calculations
Never leave a question blank — write something; even a partially correct answer can earn marks

Exam Tip: If you get stuck on a coding question, write pseudocode or describe your approach in structured English. Examiners can award marks for demonstrating understanding of the method, even if your syntax is imperfect.

Mark Allocation Patterns

Understanding how marks are allocated helps you write answers of the right length and detail:

1-mark questions: One clear, precise point. Do not write a paragraph.
2-mark questions: Two distinct points OR one point with a reason.
3-mark questions: Usually a short process (e.g., describe three steps) or an explanation with a chain of reasoning.
4-mark questions: Typically require a developed explanation or a comparison with multiple points.
6-mark questions: Extended response — need a well-structured, logical answer covering multiple points.

Final Exam Tip: Read the question twice before you begin writing. Underline the command word and the key terms. Count how many marks are available and make sure your answer has at least that many distinct points. This simple habit alone can boost your grade significantly.