A comprehensive breakdown of every Paper 1 question from 2017 to 2023, organised by topic. Use this to identify patterns, focus your revision, and find specific past paper questions to practise.

Click any segment to jump to that topic section

📋
2021 Syllabus Update Cambridge Official
New topic: Automated and Emerging Technologies
Ethics section removed from syllabus
Boolean logic moved to Paper 2
Pre-release replaced by scenario-based question (Paper 2)

Quick Navigation

Other Sections

Most Frequent Topics

Based on analysis of all papers from 2017–2023, these are the most frequently tested concepts:

Data Representation

  • Converting denary to binary and hexadecimal
  • Two's complement for signed integers
  • Binary addition and overflow errors
  • Bits, bytes, kibibytes, mebibytes
  • Binary/hexadecimal shifts

Security

  • Malware types and removal
  • Phishing and pharming
  • SSL/HTTPS and encryption
  • Firewall operation
  • Data interception methods

Networks

  • Error detection (parity, checksums, ARQ)
  • Router and network device roles
  • Network topologies
  • Data transmission types

Hardware and Software

  • Input/output device identification
  • CPU components and registers
  • Storage types (SSD vs HDD)
  • Primary vs secondary storage

Data Representation

YearSessionPaperQuestionTopic
2023W131c(i)Bits in a byte
2023W131c(ii)Kibibytes in a mebibyte
2023W132aBinary number system explanation
2023W132bConverting denary numbers to binary
2023W132cConverting denary numbers to hexadecimal
2023W132dTwo's complement for positive denary to binary
2023W132eBinary addition
2023W122a-2eBinary, hexadecimal representations, shifts, two's complement
2023S111Binary number system, conversions, two's complement, overflow error
2023M123Data storage conversions, examples of data stored in RAM
2022W132aConversion of denary values to 8-bit binary
2022W132bConversion of binary values to hexadecimal
2022W121fBinary and hexadecimal conversions for data storage
2022S114Binary data processing, binary and hexadecimal conversions
2021M121aConverting denary values to 8-bit binary
2021M121bMaximum denary value in an 8-bit binary register
2021M121cMinimum bits to store a specific denary value
2021W121a-cDenary, hexadecimal conversions to binary, usage in web development
2021S111(a)Conversion of denary values to 8-bit binary
2021W131a-1cBinary and hexadecimal conversions, data storage calculations
2019W131(d)Storing hexadecimal colour codes in binary for web design
2019W121-4Memory size, Von Neumann components, analogue to digital, binary arithmetic
2019W112(a)-(c)Binary to denary, using hexadecimal, hexadecimal equivalents
2018S135Converting numbers between binary, denary, hexadecimal
2018S121Understanding data units and conversions
2018S123Binary representations for time
2018S124Converting hexadecimal error codes to binary
2018W121ASCII, binary and hexadecimal conversions
2018W112Binary, hexadecimal conversions, using hexadecimal
2018S111Data types and number systems terms
2018S112Converting hexadecimal to denary

Data Compression

YearSessionPaperQuestionTopic
2023W137dCompression method reducing colour depth and resolution
2023W137eBenefits of image compression
2022W136Benefits of lossy compression, LED display operation
2021S117(a)-(d)Lossless compression for sound, benefits and drawbacks
2019W125-6Compression advantages/disadvantages, MIDI files
2019M126(c)Lossless compression advantages for programs
2018W111Identifying compression types
2018S114Compression types for different files

Hardware and Software

YearSessionPaperQuestionTopic
2023W131aInput devices of a mobile phone
2023W131bOutput devices of a mobile phone
2023S132a-2gCPU, registers, buses, I/O devices, primary storage, microprocessor functions
2023S121Output devices selection
2022W121Input/output devices for a ticket machine
2022W121c, 1dResistive touchscreen operation, pros/cons, alternatives
2022W111a, 1bInput device for info point, output device
2022W111cExample of primary storage
2021M123Completing device names and descriptions
2021W122a-bOutput devices, suitable input devices
2021S112(a)Devices for inputting personal data
2021S112(b)Statements about HDDs, SSDs, USB drives
2019W111(a)-(c)3D cutters, printer types and suitability
2019W114(a)-(d)I/O devices, secondary storage, QR codes
2019M122(a)-(b)Input/output device definitions and examples
2019M128USB, printer types, toner printer pros/cons
2018W125Identifying output devices
2018W115Classifying storage, optical writing, storage choice
2018W1163D printers/cutters, software, DLP technology
2018S119Secondary, offline storage, biometrics

Computer Architecture

YearSessionPaperQuestionTopic
2023W133aCPU components
2023W133bCPU cache purpose
2023W133cComponent for CPU cycles/second
2023W133dComponent for calculations & logic operations
2021M128aStored program concept
2021M128b(i)Program Counter role
2021M128b(ii)Control Bus role
2021M128cInterrupts in Von Neumann model
2018W1311Program Counter & Memory Data Register roles
2018M1210Stored program, MAR & MDR functions

Networks

YearSessionPaperQuestionTopic
2023W135aData transmission error causes
2023W135bError detection without calculated value
2023W135cARQ with positive acknowledgement operation
2023W138Router role
2021W132Network topologies, advantages, use cases
2019W133Completing data transmission statements
2018W134MAC address binary representation & storage
2018W135Serial and half-duplex transmission
2018S132Data transmission terms & applications
2018S134bParallel & serial transmission descriptions
2018S125Using parity bits for error detection
2017W124Suitable transmission & error checking methods

Communication and Internet Technologies

YearSessionPaperQuestionTopic
2023W134aMain web browser purpose
2023W134bWeb browser autofill function
2023W134cWeb browser quick access function
2023W134dHow SSL secures data
2021M121d(i)Serial vs parallel transmission
2021M121d(ii)Half-duplex data transmission
2021M121d(iii)Checksums for error detection
2022W126SSL protocol, proxy servers
2022W118HTML, secure connections, cookies
2019W113(a)-(d)Firewalls, security methods
2019W127-8Browser functions, HTTPS significance
2017W125Cookies explanation, error checking methods
2017W113URL components, IP address meaning

Programming

YearSessionPaperQuestionTopic
2023S134High-level languages, translators, executables
2022S125High-level traits, compilers, IDEs
2021W134Variables, constants, data types
2021M127aHigh-level languages
2021M127bInterpreters vs compilers
2019W132(a)High-level language characteristics & examples
2019M125-6High-level benefits, compilers vs interpreters
2018W137Interpreters, compiling, lossless compression
2018S139Assemblers, compilers, interpreters

Logic Gates

YearSessionPaperQuestionTopic
2022W135Logic circuit, truth table completion
2022W127Logic gates, truth table completion
2021M125aIdentifying logic gates from truth tables
2021M125bLogic circuit for aeroplane warning system
2019M127Circuit design, truth tables
2018W1310Truth tables, logic circuit design
2018S138Truth tables, logic circuit drawing
2018S127Logic circuit analysis
2018S116Logic circuit, truth table
2018M127Truth tables, logic circuits
2017W135Logic design, XOR gate
2017W127Logic circuit drawing
2017W115Logic circuit for statement

Security

YearSessionPaperQuestionTopic
2023W121aNon-malware cyber threat identification
2023W121bMalware examples
2023W121cMalware removal software
2023W128Data interception and solution
2022W114aElectronic bank detail theft methods
2022W114bData safety encryption, symmetric encryption
2021M122c(i)Benefit of SSL connection
2021M122c(ii)Creating SSL connection
2021M126aHow firewalls prevent hacking
2021M126bInternet risks for obtaining personal data
2021W137Cybersecurity measures, encryption techniques
2021S113Firewall operation & security methods
2021S114Phishing and pharming definitions
2019W131(b)Enhancing encryption for library archives
2019W131(c)Parity & ARQ for error management
2018W124Security risks, firewall functions
2018W114Phishing, pharming, security suggestions
2018S133Phishing, pharming, spam definitions
2018S134cEncryption enhancing security
2018S1212Securing transmitted personal data
2017W138Accidental data damage, SSL applications
2017W139Online banking security beyond SSL
2017W118Accidental data damage, SSL applications
2017W119Additional online banking security

Operating Systems

YearSessionPaperQuestionTopic
2023W131dOperating system purpose
2023S1310Virtual memory usage
2023S1311File, memory, multitasking software
2022W121eOperating system functions
2018S136OS role in handling interrupts
2018M1213Operating system functions

Database Systems

Note: Query tables (QBE) are no longer assessed since 2021. Only SQL is now tested.

YearSessionPaperQuestionTopic
2021W138Database concepts, SQL queries

How to Use This Resource

  1. Identify weak topics – Use the frequency data above to prioritise high-frequency topics
  2. Find specific questions – Use the tables to locate past paper questions on topics you want to practise
  3. Track patterns – Note which question types appear regularly (e.g., binary conversions, firewall functions)
  4. Practise systematically – Work through questions topic-by-topic rather than paper-by-paper

External Resources


Understanding Paper 2: Why Correct Code Still Loses Marks

For many students, Paper 2 feels unpredictable.

You can understand programming concepts, write working code in class, and still lose a surprising number of marks in the exam. That isn't because your logic is wrong — it's because Paper 2 does not reward programming skill in the way most students expect.

After analysing CAIE IGCSE Computer Science Paper 2 mark schemes from 2017 to 2023, a clear pattern emerges.

Paper 2 rewards approach, structure, and visibility of intent far more than syntactic accuracy or "clever" solutions.

How Paper 2 Marks Are Actually Awarded

Across multiple years and variants, the same marking behaviour appears again and again:

  • Marks are awarded per requirement, not per overall solution
  • Each bullet point or instruction in the question maps directly to marks
  • Method marks are common, even when later logic is incomplete
  • Variable names, language choice, and formatting are flexible
  • Syntax errors are often ignored if intent is clear

In short: examiners are checking boxes, not running your code.

If a requirement is not clearly met somewhere on the page, it usually earns zero — even if your overall solution would "work".

Why Students Lose Marks on Paper 2

The most common error is trying to solve the entire problem in one pass.

Students read the scenario, start writing pseudocode immediately, and aim for a complete solution as quickly as possible. This feels logical — but it hides evidence from the examiner.

When everything is written as one block:

  • It's hard to see which requirement is being met
  • Missing one step can collapse multiple marks
  • Partial understanding is not visible
  • Running out of time costs everything at once

This is why two students with similar understanding can receive very different marks.

An Examiner-Friendly Approach to Paper 2 Scenarios

High-scoring scripts almost always follow the same pattern:

  1. Extract the requirements first
    The question already lists what the program must do. These are usually written in the order the mark scheme expects.
  2. Turn each requirement into a short comment
    Each comment acts as a signpost for the examiner.
  3. Write the solution directly under each comment
    One requirement at a time. One mark opportunity at a time.

This approach does three things:

  • Makes your intent obvious
  • Prevents drifting away from the question
  • Protects marks if you run out of time

Even unfinished answers can score well if the structure is clear.

Why "correct code" still loses marks

Paper 2 is not testing whether you can program a working system.

It is testing whether you can:

  • Interpret a scenario
  • Translate requirements into algorithmic steps
  • Show those steps clearly and explicitly

A fully working solution that skips a stated requirement will lose marks. A partially completed solution that clearly addresses each requirement can still score strongly.

This is why self-marking is unreliable — students judge correctness, while examiners judge evidence.

A better way to practise Paper 2

The most effective preparation in the final weeks is not doing more questions, but practising deliberately:

  • Redo past Paper 2 scenario questions
  • Compare your answer directly to the mark scheme
  • Check whether each requirement is clearly visible
  • Ask yourself: "Would an examiner be able to award marks quickly here?"

If you want structured practice with examiner-style feedback, tools that assess answers requirement-by-requirement can help highlight where marks are actually being lost. Used properly, they can reinforce the mindset Paper 2 demands rather than encouraging guesswork.

Final takeaway

Paper 2 is predictable once you stop treating it like a programming test.

It rewards:

  • Requirement-driven thinking
  • Clear structure
  • Visible intent

If you change how you approach the question, the marks usually follow.

This mindset shift alone is often worth more than learning new syntax in the final weeks before the exam.


Further discussion

This analysis is based on recurring questions and exam-preparation discussions from students studying IGCSE Computer Science (0478), particularly around Paper 1 topic distribution and Paper 2 scenario questions.

Key ideas from this article have been explored and refined through public student discussions, including those on:

  • r/IGCSE — exam strategy and revision discussions

These discussions help highlight common misconceptions and patterns in how marks are awarded across exam series.