GCSE Computer Science Exam Study Guide (2027)
Everything the GCSE Computer Science (9-1) Exam tests, topic by topic: what each section covers, the facts that come up most, and how to study it. Pair it with the free 15-question practice test.
The exam at a glance
| Questions | OCR J277: 2 written papers, 80 marks each (160 marks in total). AQA and Edexcel also set 2 papers with different lengths |
|---|---|
| Time | 3 hours in total (2 × 1 hour 30 minutes) |
| Grades and pass mark | Grade 4 is a standard pass and grade 5 a strong pass. Boundaries are set after every exam series, so aim for 70% in practice |
| Format | Written exams, no calculator. Not tiered. In Paper 2 Section B you write or refine algorithms in OCR Exam Reference Language or a high-level language you know |
| Exam boards | OCR, AQA and Pearson Edexcel |
| Test provider | At your school or college, or as a private candidate at an exam centre that accepts them |
Mind map: the whole exam on one screen
Read the complete GCSE Computer Science study notes for “Systems Architecture, Memory and Storage”
Our first full set of comprehensive notes, about 14 minutes of reading: The purpose of the CPU · Von Neumann architecture and its registers · The fetch-execute cycle step by step · What affects CPU performance · Embedded systems · Primary storage: RAM, ROM and virtual memory · Secondary storage and choosing a device, a worked exam example, the traps examiners use and a one-minute recap. Create a free account to read it and see how premium notes work before you decide.
1. Systems Architecture, Memory and Storage
OCR J277 1.1 and 1.2 (Paper 1): the CPU and the fetch-execute cycle, von Neumann registers, factors affecting performance, embedded systems, primary storage (RAM, ROM, virtual memory) and secondary storage.
Key facts
- The CPU processes data and instructions. Its components are the arithmetic logic unit (ALU: calculations and logic), the control unit (CU: decodes instructions and coordinates data flow), cache (very fast memory for frequently used data) and registers.
- Von Neumann registers: the program counter (address of the next instruction), the memory address register (MAR, address being accessed), the memory data register (MDR, data or instruction fetched or to be written) and the accumulator (results of calculations).
- Fetch-execute cycle: the address in the PC is copied to the MAR, the PC increments, the instruction at that address is fetched into the MDR, the CU decodes it, then it is executed.
- Performance depends on clock speed (cycles per second, in GHz), cache size (more data close to the CPU) and number of cores (more instructions processed at once, if the software can use them).
- An embedded system is a computer built into a larger device to do one dedicated job, such as a washing machine controller or a car's engine management.
- RAM is volatile, read-write memory holding the programs and data in use. ROM is non-volatile and read-only; it stores the boot-up instructions (BIOS). Virtual memory uses secondary storage when RAM is full, which slows the computer.
- Secondary storage is non-volatile. Magnetic (hard disk drives) gives high capacity at low cost; optical (CD, DVD, Blu-ray) is cheap and portable but slow; solid state (SSD, USB, SD cards) is fast and durable with no moving parts.
- Choose storage using its characteristics: capacity, speed, portability, durability, reliability and cost. Justify your choice for the scenario in the question.
Flashcards
Exam tip: Doubling the number of cores does not double performance: programs must be written to split tasks between cores. Saying this earns the extra mark in 'explain' questions.
2. Data Representation
OCR J277 1.2 (Paper 1): units, binary, denary and hexadecimal conversions, binary addition and overflow, binary shifts, characters, images, sound and compression.
Key facts
- Units: bit, nibble (4 bits), byte (8 bits), kilobyte (1000 bytes), megabyte, gigabyte, terabyte, petabyte (each 1000 times the previous). OCR also accepts 1024 in calculations.
- Convert binary to denary with place values 128, 64, 32, 16, 8, 4, 2, 1. 8 bits store 0 to 255.
- Hexadecimal uses 0 to 9 and A to F (A = 10, F = 15). Each hex digit is one nibble: split binary into two nibbles to convert, so 1101 0101 = D5.
- Binary addition rules: 0 + 0 = 0, 1 + 0 = 1, 1 + 1 = 10, 1 + 1 + 1 = 11. An overflow error occurs when the result needs more bits than are available, for example a ninth bit.
- A left shift of n places multiplies by 2ⁿ; a right shift divides by 2ⁿ. Bits shifted off the end are lost, which can make the result inaccurate.
- Character sets: ASCII uses 7 bits (128 characters, often stored in 8 bits); Unicode uses more bits so it can represent characters from all languages, but files are larger. Character codes are grouped and run in sequence, so 'B' is one more than 'A'.
- Images are pixels. File size (bits) = colour depth × width × height. More colour depth or higher resolution improves quality but increases file size. Metadata stores information such as width, height and colour depth.
- Sound file size (bits) = sample rate (Hz) × duration (s) × bit depth. Lossy compression (MP3, JPEG) removes data permanently and gives smaller files; lossless compression (ZIP, PNG) lets the original be fully restored.
Flashcards
Exam tip: File-size formulas give bits. Divide by 8 for bytes, then by 1000 for kilobytes. Writing the units at every step stops you mixing them up.
3. Networks and Network Security
OCR J277 1.3 and 1.4 (Paper 1): LANs and WANs, network performance, client-server and peer-to-peer, hardware, the internet, star and mesh topologies, wired and wireless connections, protocols and layers, threats and how to prevent them.
Key facts
- A LAN covers a small geographical area and uses hardware the organisation owns. A WAN covers a large area and uses third-party infrastructure such as leased lines. The internet is a worldwide WAN.
- Performance is affected by bandwidth, the number of users, transmission media, error rates and latency. Client-server networks centralise files and security; peer-to-peer networks share resources between equal computers.
- Hardware: wireless access points, routers (send packets between networks), switches (send data to the correct device on a LAN), network interface controllers and transmission media. DNS translates domain names into IP addresses.
- Star topology: every device connects to a central switch, so one cable failing affects only one device, but the switch is a single point of failure. Mesh: devices interconnect, so data can take other routes, but it needs more cabling.
- Wi-Fi and Ethernet are standards. Encryption protects transmitted data. IP addresses (IPv4, IPv6) identify devices on a network; MAC addresses are unique to each network interface.
- Protocols: TCP/IP (transmission and routing), HTTP and HTTPS (web pages, HTTPS encrypted), FTP (file transfer), POP and IMAP (receiving email), SMTP (sending email). Layers divide networking into independent parts, making development and fault-finding easier.
- Threats: malware, social engineering such as phishing, brute-force attacks, denial of service, data interception and theft, and SQL injection.
- Prevention: penetration testing, anti-malware software, firewalls, user access levels, strong passwords, encryption and physical security.
Flashcards
Exam tip: Match each threat to a specific prevention: brute force with strong passwords and lockouts, SQL injection with input validation, phishing with staff training. Generic answers like 'use antivirus' rarely get full marks.
Test yourself on these topics
Take the free 15-question GCSE Computer Science test, then save your results to unlock your Readiness Score and the mistakes bank.
4. Systems Software and Ethical, Legal and Environmental Issues
OCR J277 1.5 and 1.6 (Paper 1): operating system functions, utility software, and the ethical, legal, cultural, environmental and privacy impacts of digital technology, including the laws you must name.
Key facts
- Operating system functions: user interface, memory management and multitasking, peripheral management and drivers, user management (accounts, access rights) and file management (naming, folders, moving, saving).
- Device drivers let the operating system communicate with a specific piece of hardware.
Flashcards
Exam tip: Paper 1 includes a longer extended-response question, often on ethical, legal or environmental issues. Plan three areas, give points on both sides, link to the scenario and finish with a judgement.
5. Algorithms
OCR J277 2.1 (Paper 2): computational thinking, designing and refining algorithms with pseudocode and flowcharts, trace tables, and the standard searching and sorting algorithms.
Key facts
- Abstraction removes unnecessary detail to focus on what matters. Decomposition breaks a problem into smaller parts. Algorithmic thinking works out the steps needed to solve the problem.
- Identify inputs, processes and outputs. Structure diagrams show a problem decomposed into sub-sections.
Flashcards
Exam tip: When asked to show the steps of a sort or search, write the list out in full after every step. Examiners mark each stage, so a skipped line loses marks even if your final answer is right.
6. Programming Fundamentals and Robust Programs
OCR J277 2.2 and 2.3 (Paper 2): variables and constants, the three programming constructs, operators, data types and casting, strings, files, arrays, SQL, sub programs, defensive design and testing.
Key facts
- Variables can change while a program runs; constants cannot. Use meaningful identifiers. Assignment uses =, and comparison uses ==, !=, <, <=, > and >=.
- The three constructs are sequence, selection (if, elseif, else, switch/case) and iteration: count-controlled (for loops) and condition-controlled (while and do until loops).
Flashcards
Exam tip: In code-writing questions, marks come for each correct part: input, validation, loop, condition, output. Write something for every part even if you can't finish, and use indentation so the examiner can follow it.
7. Boolean Logic and Programming Languages
OCR J277 2.4 and 2.5 (Paper 2): AND, OR and NOT gates, truth tables and logic diagrams with up to three inputs, high- and low-level languages, compilers, interpreters and IDEs.
Key facts
- AND outputs 1 only if both inputs are 1. OR outputs 1 if at least one input is 1. NOT inverts a single input.
- Truth tables list every input combination: 2 inputs give 4 rows and 3 inputs give 8 rows. Work out intermediate columns (such as A AND B) before the final output.
Flashcards
Exam tip: For 3-input truth tables, list inputs in binary counting order (000, 001, 010 ... 111). It guarantees you have all 8 rows and none twice.
How to pass
- 80 marks in 90 minutes is just over a minute per mark. Short recall questions should take less than that so you have time for the longer algorithm questions in Paper 2 Section B.
- Both papers are non-calculator. Practise binary, hexadecimal and file-size calculations by hand, and show your working because method marks are available.
- Use a trace table for every 'what is output' question: one column per variable and a new row each time a value changes.
- Read command words: 'state' needs a fact, 'describe' needs a point with detail, and 'explain' needs a reason (because...). For 'compare', say which is better and why.
- When writing code, use clear variable names, indentation and correct structure. Examiners accept OCR Exam Reference Language or a high-level language such as Python, but the logic must be precise.
Frequently asked questions
How long should I study for the GCSE Computer Science exam?
Most students do best starting 10 to 12 weeks before the first paper, with 30 to 45 minutes a day per subject. You're ready once your Readiness Score has stayed at 80 or higher for about a week.
Can I take the GCSE Computer Science exam online?
No. GCSE Computer Science is a written exam sat in person at your school, college or an approved exam centre. Format: written exams, no calculator. Not tiered. In Paper 2 Section B you write or refine algorithms in OCR Exam Reference Language or a high-level language you know. Check your exam board's timetable for dates.
What score do I need to pass the GCSE Computer Science exam?
Grade 4 is a standard pass and grade 5 a strong pass. Boundaries are set after every exam series, so aim for 70% in practice. The exam has ocr j277: 2 written papers, 80 marks each (160 marks in total). aqa and edexcel also set 2 papers with different lengths and a time limit of 3 hours in total (2 × 1 hour 30 minutes).
What are the most tested topics?
The outline covers systems architecture, memory and storage, data representation, networks and network security, systems software and ethical, legal and environmental issues, algorithms, programming fundamentals and robust programs, boolean logic and programming languages. Use the free practice test to see which ones you need most.
The premium GCSE Computer Science study path
Premium GCSE Computer Science prep is studied one topic at a time. Each step starts with that topic's key notes and flashcard deck, then its own question sets of 25, so you master one topic before you move to the next. When every topic is strong, the 6 full mock exams show you're ready.
Your step-by-step study path
- 1Systems Architecture, Memory and Storage9 key notes, 115 flashcards, then 450 practice questions in 18 sets of 25Notes free with an account
- 2Data Representation9 key notes, 115 flashcards, then 425 practice questions in 17 sets of 25Premium
- 3Networks and Network Security9 key notes, 115 flashcards, then 425 practice questions in 17 sets of 25Premium
- 4Systems Software and Ethical, Legal and Environmental Issues9 key notes, 115 flashcards, then 425 practice questions in 17 sets of 25Premium
- 5Algorithms8 key notes, 115 flashcards, then 425 practice questions in 17 sets of 25Premium
- 6Programming Fundamentals and Robust Programs8 key notes, 115 flashcards, then 425 practice questions in 17 sets of 25Premium
- 7Boolean Logic and Programming Languages8 key notes, 110 flashcards, then 425 practice questions in 17 sets of 25Premium
- Final step: 6 full mock exams277 questions each, timed like exam day. Hit your target on them before your first paper.Premium
Get every note, flashcard and question
Premium Monthly
- One subject of your choice: any GCSE, A-level or Functional Skills exam
- 3,000 practice questions + 6 full mock exams per exam
- 800 flashcards + 60 key notes per exam, by topic, plus mind maps
- Spaced repetition + mistakes bank
- Readiness Score & detailed reports
- Video lessons as they release
- Content updates during your access
- 5 bonuses: GCSE Maths formula sheet, command words cheat sheet, 12-week revision planner and more
- Pass Guarantee: complete the prep, pass or 100% back
Renews monthly until you cancel. Cancel in two clicks from your account; you keep access until the end of the month you've paid for. No minimum term.
Premium Yearly
- One subject of your choice: any GCSE, A-level or Functional Skills exam
- 3,000 practice questions + 6 full mock exams per exam
- 800 flashcards + 60 key notes per exam, by topic, plus mind maps
- Spaced repetition + mistakes bank
- Readiness Score & detailed reports
- Video lessons as they release
- Content updates during your access
- 5 bonuses: GCSE Maths formula sheet, command words cheat sheet, 12-week revision planner and more
- Pass Guarantee: complete the prep, pass or 100% back
Renews once a year until you cancel. We email you before each renewal. Cancel any time from your account; you keep access until the end of the year you've paid for.
Summarised from the exam boards' published specifications and the rules cited, checked November 2026. Confirm current requirements with OCR, AQA and Pearson Edexcel.