Skip to content

Log in Sign up free

Loading…

Home
Subjects
Past papers
Key terms
Pricing

My courses

Select your courses

Loading…

Subjects

Biology
Business
Chemistry
Citizenship Studies
Classics
Combined Science
Computer Science
Design and Technology
English Language
English Literature
Film Studies
Food Preparation and Nutrition
Geography
History
Mathematics
Media Studies
Physical Education
Physics
Psychology
Religious Studies
Sociology
Statistics

Resources

Browse courses
Past papers
Key terms & definitions
Pricing

About

Sign up
Log in
Privacy Policy
Terms of Service

© 2026 GradeGen

Not affiliated with any exam board.

Home
Computer Science
AQA GCSE Computer Science
Paper 1

AQA GCSE Computer Science · 8525

AQA GCSE Computer Science Paper 1

Computational thinking and programming skills

Length: 2 hours
Marks: 90
Weighting: 50% of the GCSE

From the AQA specification (opens in a new tab), Version 1.3 16 June 2025, PDF page 7.

2 sections · 46 revision notes

What’s on Paper 1

3.1 Fundamentals of algorithms

Representing algorithms · Efficiency of algorithms · Searching algorithms · Sorting algorithms14 notes

3.1.1 Representing algorithms

Algorithm Definition
Decomposition

Paper 1 past papers

We can’t match AQA GCSE Computer Science’s past papers to Paper 1 yet.

All AQA GCSE Computer Science past papers

Other papers

Algorithm Representation

Algorithm Structure

Algorithm Purpose

3.1.2 Efficiency of algorithms

Multiple Algorithmic Solutions
Algorithmic Efficiency

3.1.3 Searching algorithms

Linear Search
Binary Search
Linear vs Binary Search

3.1.4 Sorting algorithms

Merge Sort
Bubble Sort
Merge Sort vs Bubble Sort

Fundamentals of algorithms overview

3.2 Programming

Data types · Programming concepts · Arithmetic Operations · Relational Operations · Boolean Operations · Data structures · Input/output · String Handling Operations · Random Number Generation · Structured Programming and Subroutines · Robust and Secure Programming32 notes

3.2.1 Data types

Data Type Concept
Common Data Types

3.2.2 Programming concepts

Statement Combinations
Iteration Structures
Nested Structures
Identifier Names

3.2.3 Arithmetic Operations

Basic Arithmetic Operators

3.2.4 Relational Operations

Relational Operators

3.2.5 Boolean Operations

Logical Operators

3.2.6 Data structures

Data Structure Concept
Arrays
Records

3.2.7 Input/output

User Input
Data Output

3.2.8 String Handling Operations

String Manipulation

3.2.9 Random Number Generation

Implementing Random Numbers

3.2.10 Structured Programming and Subroutines

Subroutine Concept
Advantages of Subroutines
Passing Parameters
Returning Values

3.2.11 Robust and Secure Programming

Data Validation
Authentication Routines
Testing Concept
Correcting Errors

Programming overview

Local Variables

Using Local Variables

Structured Programming

Advantages of Structured Approach

Types of Test Data

Selecting Test Data

Identifying Errors