Skip to content
← Back to all posts

AQA GCSE Computer Science Exam Guide: Paper 1 & 2 Strategy

LearningBro Team··11 min read
AQAGCSEComputer Scienceexam techniqueexam preparation

AQA GCSE Computer Science Exam Guide: Paper 1 & 2 Strategy

AQA GCSE Computer Science is unlike most other GCSEs. It is not a subject where you can rely on memorising content and writing essays. Instead, it tests your ability to think logically, read and write code, apply computational thinking, and explain technical concepts clearly. The exam rewards precision, and sloppy technique -- even when you understand the underlying concept -- will cost you marks.

This guide covers both Paper 1 and Paper 2, with detailed advice on the question types you will face, the AQA pseudo-code conventions you must know, and the exam strategies that separate strong candidates from average ones.

Understanding the Two Papers

Paper 1: Computational Thinking and Programming Skills

  • 1 hour 30 minutes, 80 marks (50% of GCSE)
  • Written exam
  • Tests computational thinking, problem-solving, code tracing, code writing, and algorithm design
  • Questions will use the AQA pseudo-code and/or a high-level programming language (Python, VB.NET, or C#)

Paper 2: Computing Concepts

  • 1 hour 30 minutes, 80 marks (50% of GCSE)
  • Written exam
  • Tests theoretical knowledge: hardware, software, networking, cyber security, data representation, and ethical/legal issues

Paper 1 is the more challenging paper for most students because it requires active problem-solving rather than recall. Paper 2 is more knowledge-based but still requires precise technical language and the ability to apply concepts to unfamiliar scenarios.

AQA Pseudo-Code Conventions

AQA uses its own pseudo-code syntax in exam questions. You must be able to read and understand this syntax, even if you programmed in Python, VB.NET, or C# during your course. The pseudo-code is not identical to any real programming language, so you need to familiarise yourself with its specific conventions.

Key Syntax to Know

Variables and Assignment: Variables do not need to be declared. Assignment uses an arrow: x <- 5

Output: OUTPUT 'Hello' or OUTPUT x

Input: x <- USERINPUT

Arithmetic Operators:

  • Addition: +
  • Subtraction: -
  • Multiplication: *
  • Division: /
  • Integer division (quotient): DIV
  • Remainder (modulus): MOD

Comparison Operators:

  • Equal to: =
  • Not equal to: != or the "not equals" symbol
  • Less than: <
  • Greater than: >
  • Less than or equal to: <=
  • Greater than or equal to: >=

Selection (IF statements):

IF condition THEN
    statements
ELSE
    statements
ENDIF

Iteration (FOR loop):

FOR i <- 1 TO 10
    statements
ENDFOR

Iteration (WHILE loop):

WHILE condition
    statements
ENDWHILE

Iteration (REPEAT-UNTIL loop):

REPEAT
    statements
UNTIL condition

Subroutines:

SUBROUTINE name(parameters)
    statements
    RETURN value
ENDSUBROUTINE

String Operations:

  • Length: LEN(string)
  • Substring: SUBSTRING(position, length, string)
  • Concatenation: Uses + or explicit concatenation

Arrays: Arrays are indexed from 0. Access elements with array[index].

Why This Matters

In the exam, you will be given code in AQA pseudo-code and asked to trace through it, identify outputs, spot errors, or complete missing sections. If you misunderstand the syntax -- for example, confusing DIV (integer division) with / (real division) -- you will get the wrong answer even if your logic is correct.

Practical tip: Download the AQA pseudo-code guide from the AQA website and practise reading code written in this format. If you programmed in Python during your course, pay particular attention to the differences in syntax for loops, input/output, and string operations.

Trace Table Technique

Trace tables are one of the most predictable question types on Paper 1. You will be given a piece of code and asked to complete a trace table showing the values of variables as the program executes.

How to Complete a Trace Table

  1. Read the code carefully before starting. Understand the overall purpose of the program. Identify the loops, the conditions, and the variables.

  2. Set up the table correctly. Each column represents a variable. Each row represents a change in value. Some trace tables also have a column for output.

  3. Work through the code line by line. Do not try to skip ahead or predict the outcome. Follow each line of execution in order, updating the trace table as values change.

  4. Be careful with loops. Count the iterations carefully. A FOR i <- 1 TO 5 loop executes 5 times, with i taking values 1, 2, 3, 4, 5. A WHILE loop continues until the condition becomes false -- trace through each iteration.

  5. Watch for off-by-one errors. These are the most common mistake in trace tables. Does the loop start at 0 or 1? Does it include the final value or stop before it? Does the condition check happen before or after the loop body executes?

  6. Record every change. If a variable changes value, record the new value on a new row. Do not overwrite previous values -- the examiner needs to see the history.

Example

Given this code:

x <- 1
FOR i <- 1 TO 4
    x <- x * 2
    OUTPUT x
ENDFOR

Your trace table should show:

i x OUTPUT
- 1 -
1 2 2
2 4 4
3 8 8
4 16 16

Common Trace Table Mistakes

  • Not initialising variables. If a variable is assigned a value before the loop, record that initial value.
  • Confusing DIV and /. 7 DIV 2 = 3 (integer division, truncates the decimal). 7 / 2 = 3.5.
  • Forgetting that MOD gives the remainder. 7 MOD 2 = 1. 10 MOD 3 = 1.
  • Miscounting loop iterations. FOR i <- 0 TO 4 runs 5 times (0, 1, 2, 3, 4), not 4.
  • Not distinguishing between WHILE and REPEAT-UNTIL. A WHILE loop checks the condition before each iteration (so it might execute zero times). A REPEAT-UNTIL loop checks after each iteration (so it always executes at least once).

Algorithm Design Questions

Paper 1 includes questions that ask you to design algorithms, either by writing pseudo-code, completing partial code, or creating flowcharts.

Writing Pseudo-Code from Scratch

When asked to write an algorithm:

  1. Read the question carefully. Identify the inputs, the processing required, and the expected outputs.
  2. Plan before you write. Sketch the logic in your head or on paper. What variables do you need? What loops or conditions are required?
  3. Write clean, structured code. Use indentation to show the structure of your loops and conditions. Use meaningful variable names.
  4. Test your code mentally. Pick a simple example and trace through your algorithm to check it produces the correct output.

Completing Partial Code

These questions give you a partially written program with blanks to fill in. Read the entire program first to understand its purpose before filling in the gaps. The context of the surrounding code often tells you exactly what the missing line should do.

Flowcharts

If asked to create or interpret a flowchart:

  • Terminators (rounded rectangles): Start and End.
  • Processes (rectangles): Calculations or assignments.
  • Decisions (diamonds): Yes/No conditions. Each diamond must have two clearly labelled exit paths.
  • Input/Output (parallelograms): Data entering or leaving the system.
  • Arrows: Show the flow of control. Make sure your arrows are clear and unambiguous.

Boolean Logic

Boolean logic questions appear on Paper 2 but are also relevant to understanding conditions in Paper 1. You need to know the three basic Boolean operators and how to apply them.

The Three Operators

  • AND: True only when both inputs are True.
  • OR: True when at least one input is True.
  • NOT: Inverts the input. True becomes False, False becomes True.

Truth Tables

You must be able to complete truth tables for expressions involving AND, OR, and NOT. For a two-input expression, the truth table has 4 rows (all combinations of True/False for two inputs). For three inputs, it has 8 rows.

Example: A AND (NOT B)

A B NOT B A AND (NOT B)
0 0 1 0
0 1 0 0
1 0 1 1
1 1 0 0

Logic Gates

Know the symbols for AND, OR, and NOT gates. Be able to trace inputs through a logic gate diagram to determine the output. Work through the diagram systematically, calculating the output of each gate in order.

Boolean Algebra

You may be asked to write or simplify Boolean expressions. Use the standard notation:

  • AND is represented by a dot (.) or by writing the variables together (AB)
  • OR is represented by a plus (+)
  • NOT is represented by a bar over the variable or by a NOT prefix

Extended Answer Questions

Both papers include extended answer questions worth 6-8 marks. These require you to explain, discuss, or evaluate technical concepts in depth.

How to Structure Extended Answers

Use paragraphs. Do not write one continuous block of text. Each paragraph should address a distinct point.

Use technical terminology. The mark scheme rewards precise use of computing terms. Do not say "the computer remembers things" when you mean "data is stored in RAM."

Give examples. Abstract explanations become concrete with examples. If you are explaining the purpose of secondary storage, give specific examples (HDD, SSD, optical disc) and explain when each would be appropriate.

Answer the question asked. If the question asks you to "discuss the advantages and disadvantages," make sure you cover both. If it asks you to "explain how," focus on the mechanism, not just the outcome.

Common Extended Answer Topics (Paper 2)

  • Comparing types of storage (magnetic, solid-state, optical).
  • Network topologies (star vs mesh, advantages and disadvantages).
  • Cyber security threats and prevention (malware types, social engineering, firewalls, encryption).
  • Ethical, legal, and environmental issues (Data Protection Act, Computer Misuse Act, Freedom of Information Act, environmental impact of computing).
  • Data representation (binary, hexadecimal, character encoding, image and sound representation).
  • Systems architecture (CPU components, fetch-decode-execute cycle, Von Neumann architecture).

Tips for Paper 2 Extended Answers

  • Define key terms. If a question asks about "open source software," start by defining what it means before discussing its advantages and disadvantages.
  • Compare and contrast explicitly. Use phrases like "in contrast," "however," "whereas," and "on the other hand."
  • Relate to real-world contexts. If discussing network security, refer to realistic scenarios such as a business protecting customer data or a school filtering internet access.

Data Representation Questions

Data representation is a topic that spans both papers. You need to be confident with:

Binary and Hexadecimal

  • Converting between binary, denary (decimal), and hexadecimal. Practise these conversions until they are automatic.
  • Binary addition. Know how to add two binary numbers, including carrying. Be aware of overflow (when the result exceeds the available number of bits).
  • Binary shifts. A left shift multiplies by 2 for each position shifted. A right shift divides by 2 (integer division).

Character Encoding

  • ASCII uses 7 bits to represent 128 characters (or 8 bits for extended ASCII with 256 characters).
  • Unicode uses up to 32 bits and can represent characters from all writing systems worldwide.
  • Know why Unicode was needed (ASCII could not represent non-Latin scripts) and the trade-off (Unicode requires more storage per character).

Image Representation

  • Image size = width x height x colour depth. Understand how changing resolution or colour depth affects file size.
  • Metadata includes information such as image dimensions, colour depth, and creation date.

Sound Representation

  • Sample rate (how many samples per second, measured in Hz).
  • Bit depth (how many bits per sample).
  • File size = sample rate x bit depth x duration (in seconds). Increasing sample rate or bit depth improves quality but increases file size.

Time Management

Both papers are 1 hour 30 minutes for 80 marks, giving you just over one minute per mark.

  • 1-2 mark questions: 1-2 minutes. Quick recall or simple application.
  • 3-4 mark questions: 3-5 minutes. May involve a short calculation, trace, or explanation.
  • 5-6 mark questions: 6-8 minutes. Extended explanation or algorithm writing.
  • 8-mark questions: 10-12 minutes. Full extended answer with technical detail.

For trace table questions, budget extra time. They are time-consuming because you must work through every line of code carefully. Rushing a trace table almost always leads to errors.

Prepare with LearningBro

LearningBro's GCSE Computer Science exam preparation course is designed specifically for AQA students. Each lesson focuses on a key topic from the AQA specification, with practice questions that mirror the format and difficulty of the real exam. You will practise trace tables, algorithm design, Boolean logic, and extended writing -- building the computational thinking skills that AQA rewards.

Try a free lesson preview to see how the course works. With consistent practice using the right question types, you will walk into the exam knowing exactly how to tackle every question on both papers.

Good luck with your revision. You have got this.

← Back to all posts