AQA GCSE Computer Science Paper 1: Revision
Guide
,Paper 1: Exam Overview
Exam Length Weighting
2 hours of focused assessment, so effective time This paper accounts for 50% of your overall GCSE
management is crucial. grade, making it highly significant.
Skills Tested Question Types
Evaluates computational thinking, problem-solving, Expect a mix of multiple-choice, short-answer, and
programming skills, and algorithmic understanding. extended-response logic questions.
To approach algorithm and coding questions effectively, always break down the problem into smaller, manageable parts.
Plan your logic using flowcharts or pseudocode before writing any code. For tracing, create a table to track variable values
step-by-step.
,Algorithms: Key Knowledge
What are Algorithms? Flowcharts & Pseudocode Tracing & Testing
A sequence of unambiguous Visual (flowcharts) and textual Manually working through an
instructions for solving a problem or (pseudocode) methods to represent algorithm with test data to verify its
performing a computation. algorithmic logic. correctness and refine it.
Every algorithm follows the Input-Process-Output (IPO) model. Input is data received, process is the manipulation of that
data, and output is the result. Subroutines and modular design break down complex problems into smaller, reusable
functions or procedures, making code easier to manage and debug.
, Algorithms: Searching & Sorting
Linear Search
Checks each item in a list sequentially until the target is
found or the list ends. Simple but inefficient for large
datasets.
Binary Search
Requires a sorted list. It repeatedly divides the search
interval in half. Much more efficient than linear search for
large, sorted lists.
Bubble Sort
Compares adjacent elements and swaps them if they are in the wrong order, repeating passes until no swaps are needed.
Easy to understand but highly inefficient for large lists due to its quadratic time complexity.
Exam Tip: Be prepared to provide step-by-step examples and analyse the strengths and weaknesses of each
algorithm.
Guide
,Paper 1: Exam Overview
Exam Length Weighting
2 hours of focused assessment, so effective time This paper accounts for 50% of your overall GCSE
management is crucial. grade, making it highly significant.
Skills Tested Question Types
Evaluates computational thinking, problem-solving, Expect a mix of multiple-choice, short-answer, and
programming skills, and algorithmic understanding. extended-response logic questions.
To approach algorithm and coding questions effectively, always break down the problem into smaller, manageable parts.
Plan your logic using flowcharts or pseudocode before writing any code. For tracing, create a table to track variable values
step-by-step.
,Algorithms: Key Knowledge
What are Algorithms? Flowcharts & Pseudocode Tracing & Testing
A sequence of unambiguous Visual (flowcharts) and textual Manually working through an
instructions for solving a problem or (pseudocode) methods to represent algorithm with test data to verify its
performing a computation. algorithmic logic. correctness and refine it.
Every algorithm follows the Input-Process-Output (IPO) model. Input is data received, process is the manipulation of that
data, and output is the result. Subroutines and modular design break down complex problems into smaller, reusable
functions or procedures, making code easier to manage and debug.
, Algorithms: Searching & Sorting
Linear Search
Checks each item in a list sequentially until the target is
found or the list ends. Simple but inefficient for large
datasets.
Binary Search
Requires a sorted list. It repeatedly divides the search
interval in half. Much more efficient than linear search for
large, sorted lists.
Bubble Sort
Compares adjacent elements and swaps them if they are in the wrong order, repeating passes until no swaps are needed.
Easy to understand but highly inefficient for large lists due to its quadratic time complexity.
Exam Tip: Be prepared to provide step-by-step examples and analyse the strengths and weaknesses of each
algorithm.
