GCSE Computer Science Paper 1 vs Paper 2 — What's on Each and How to Prepare

One of the most common questions GCSE Computer Science students ask is: “What’s actually on each paper?” It is a reasonable question — the two papers cover very different kinds of material, and your revision strategy should reflect that.

This guide breaks down exactly what appears on Paper 1 and Paper 2 for AQA (8525), OCR (J277) and Cambridge IGCSE (0478), explains how the marks are allocated, and gives practical revision advice for each section.

---

The overall structure

All three major exam boards split GCSE Computer Science into two written papers, each worth 50% of the total GCSE:

Board	Paper 1	Paper 2
AQA 8525	Computer Systems — 1h 30m, 80 marks	Computational Thinking, Algorithms & Programming — 1h 30m, 80 marks
OCR J277	Computer Systems — 1h 30m, 80 marks	Computational Thinking, Algorithms & Programming — 1h 30m, 80 marks
Cambridge 0478	Theory of Computer Science — 1h 45m, 75 marks	Problem-solving and Programming — 1h 45m, 50 marks

No calculators are permitted in either paper for any board.

---

Paper 1 — Computer Systems (theory)

Paper 1 is the hardware, software and networking paper. It is heavily definition-based and rewards students who can recall and apply technical knowledge accurately.

Topics covered across all boards

CPU and systems architecture

• The fetch-decode-execute cycle — including the specific role of each register (PC, MAR, MDR, CIR, ACC)
• Factors affecting CPU performance: clock speed, number of cores, cache size
• Secondary storage types: magnetic (HDD), optical (CD/DVD/Blu-ray), solid state (SSD/flash) — their characteristics, advantages and disadvantages

Memory

• Primary storage: RAM (volatile, read/write) vs ROM (non-volatile, read-only)
• The purpose of cache memory
• Virtual memory (A Level boards cover this in more depth than GCSE)

Data representation

• Binary, denary and hexadecimal — converting between all three, without a calculator
• Units: bits, bytes, kilobytes, megabytes, gigabytes, terabytes
• File sizes: pixels × colour depth = image size in bits; sampling rate × bit depth × duration = audio size
• Character encoding: ASCII and Unicode
• Compression: lossy vs lossless, with examples

Networks and communications

• Types of networks: LAN, WAN, PAN
• Network topologies: star, mesh, bus — advantages and disadvantages of each
• Wired vs wireless connectivity
• Network protocols: TCP/IP, HTTP, HTTPS, FTP, DNS, SMTP
• Network hardware: routers, switches, WAPs, NICs

Network security

• Types of attack: malware (viruses, worms, ransomware, spyware), phishing, brute force, denial of service, SQL injection
• Security measures: firewalls, antivirus software, encryption, strong passwords, two-factor authentication, user access levels

Systems software

• The role of the operating system: process management, memory management, file management, I/O management, security
• Translators: compilers, interpreters and assemblers — what each does, advantages and disadvantages

Ethical, legal and environmental issues

• Computer Misuse Act 1990 (three sections)
• Data Protection Act 2018 / GDPR (eight principles)
• Copyright, Designs and Patents Act 1988
• Ethical issues: surveillance, environmental impact, bias in AI, digital divide

How to revise Paper 1

Paper 1 rewards students who can define, describe and explain technical concepts clearly. The best revision approach:

1. Use flashcards for definitions — register names and their roles, network topologies and their properties, protocol names and purposes
2. Practise binary/hex conversion daily — it is guaranteed to appear and calculators are not permitted
3. Write out the FDE cycle from memory — exam questions often ask for the specific register transfers
4. Learn to match threats to defences — the mark scheme expects specific pairings (phishing → user training + email filtering, not just “antivirus”)
5. Use our revision notes which cover every spec point with worked examples

---

Paper 2 — Computational Thinking, Algorithms and Programming

Paper 2 is fundamentally different from Paper 1. It is practical — you write code, trace algorithms and design solutions from scratch. Reading notes alone will not prepare you for Paper 2. You must practise.

Topics covered across all boards

Computational thinking

• Decomposition: breaking a problem into sub-problems
• Abstraction: removing unnecessary detail
• Pattern recognition: identifying similar problems
• Algorithmic thinking: designing step-by-step solutions

Algorithms and flowcharts

• Drawing and interpreting flowcharts (standard symbols: start/end ovals, process rectangles, decision diamonds)
• Writing pseudocode — in the exam board’s specific style
• Searching: linear search (trace every step) and binary search (show low, mid, high at each step)
• Sorting: bubble sort (trace every comparison in every pass), insertion sort, and for some boards, merge sort

Programming — the bulk of Paper 2

• Variables, constants and data types (integer, float, string, boolean)
• Input and output
• Selection: IF / ELIF / ELSE
• Iteration: FOR loops (definite) and WHILE loops (indefinite)
• Functions / procedures and return values
• Lists / arrays and list operations
• String manipulation
• File handling (read, write, append)
• Validation and error handling

Boolean logic (particularly AQA and OCR)

• AND, OR, NOT — truth tables and logic gate symbols
• NAND, NOR, XOR — truth tables
• Drawing logic circuits from Boolean expressions
• Completing truth tables for circuits

How to revise Paper 2

Paper 2 requires active practice, not passive reading:

1. Write Python code from scratch every day — even 15 minutes of practice problems
2. Trace algorithms by hand — write out every comparison and every variable value; do not skip steps
3. Learn the specific pseudocode style for your board — AQA, OCR and Cambridge each have different syntax
4. Do the bubble sort 20 times — it appears every year; you must be able to trace every pass without mistakes
5. Use the algorithm visualiser to see sorting and searching step-by-step with auto-generated trace tables
6. Use the Python Playground to write and test code in the browser

---

The biggest difference between Paper 1 and Paper 2

Paper 1 tests what you know. Paper 2 tests what you can do.

You can revise Paper 1 effectively by reading, making flashcards and practising recall. But no amount of reading will prepare you to write a working binary search function under timed conditions if you have never written one before.

For Paper 2, the most effective revision is completing past paper questions — writing complete programs, tracing algorithms, and building logic circuits — and checking your answers against the mark scheme.

---

Exam technique for each paper

Paper 1

• “State” questions: one fact, one sentence, no padding
• “Describe” questions: multiple features with detail — use bullet points
• “Explain” questions: fact + reason, use the word “because”
• File size calculations: always show your working — even partial marks if the final answer is wrong

Paper 2

• Trace table questions: show EVERY comparison, not just swaps or changes; one mark per correct step
• Code writing: comment what each section does if you are unsure of the syntax — the examiner can still give credit
• Flowchart questions: every decision diamond must have exactly two exits labelled YES and NO; every path must reach STOP

---

Resources

• AQA GCSE revision page — topics, sample questions and tools for spec 8525
• OCR GCSE revision page — topics, sample questions and tools for spec J277
• Cambridge IGCSE revision page — topics and tools for spec 0478
• Question bank — hundreds of exam-style questions with mark schemes
• Algorithm visualiser — bubble sort, binary search, Dijkstra and A* with live trace tables
• Logic gate simulator — AND, OR, NOT, NAND, NOR, XOR with auto-generated truth tables
• Binary and hex converter — practise data representation conversions