Sign in
Cambridge O Level

Computer Science 2210

Computer systems, data, networks and security, and algorithmic thinking and programming for O Level.

Syllabus version: 2026–2028 syllabusChecked against the Cambridge syllabusExam year 2027 is covered by the 2026–2028 syllabus.
Subject review complete (21 Oct 2026). All 40 Computer Science questions were re-solved and checked against the syllabus and Cambridge mark-scheme conventions, and their auto-marking was tested with correct and incorrect answers: 26 approved as written, 14 corrected.
Paper 1 Computer Systems: 50%Paper 2 Algorithms, Programming and Logic: 50%Weighting2 papers
  • Paper 1 Computer Systems50%
  • Paper 2 Algorithms, Programming and Logic50%
Original questions40
Topics covered10/10
Papers2
Mock papers2

What is assessed

2 components. Question formats: short answer, structured, programming.

Paper 1 Computer Systems
1 h 45 min75 marksWeighting 50%

Compulsory short-answer and structured questions on Topics 1–6: data representation, data transmission, hardware, software, the internet and its uses, and automated and emerging technologies.

What the paper looks like

Around ten compulsory multi-part questions (75 marks in 1 hour 45 minutes), each set in a context such as a tablet computer, a network or a farm robot. Parts range from 1-mark “Tick one box”, “State” and “Give” items, through binary/hexadecimal conversions, two’s complement, shifts and file-size calculations done without a calculator (showing working, using 1024), to 3–6 mark “Describe” and “Explain” parts on topics such as packet switching, error detection with ARQ, the FDE cycle, interrupts, cyber security and automated systems. Some questions ask candidates to complete a paragraph with missing terms, match statements, complete a table or draw a labelled diagram. Marks go to precise technical terms applied to the context.

Short answerStructuredNo calculators; no additional materials
Checked against the Cambridge syllabus
Paper 2 Algorithms, Programming and Logic
1 h 45 min75 marksWeighting 50%

Compulsory short-answer and structured questions on Topics 7–10, answered in pseudocode, ending with a 15-mark unseen scenario that may be answered in pseudocode, Python, Visual Basic or Java.

What the paper looks like

About ten compulsory questions (75 marks, 1 hour 45 minutes, no calculator). Early questions are short: tick-box items on validation or design, matching descriptions to programming concepts, data types with examples, calling a procedure, string and library routines. Middle questions involve finding and correcting errors in numbered pseudocode, writing short pseudocode (CASE, validation loops, totalling/counting, file handling), completing a trace table from a flowchart or pseudocode (about 6–7 marks), a logic expression or problem statement turned into a circuit (about 5 marks) and a truth table (4 marks), and a single-table database with primary key, data types and SQL. The paper ends with a 15-mark unseen scenario (about 30 minutes) using 1D/2D arrays, answered in pseudocode, Python, Visual Basic or Java and marked with level descriptors. From 2029 all programming answers are in Python and the scenario is split into points-marked sub-parts.

Short answerStructuredProgrammingNo calculators; no additional materials
Checked against the Cambridge syllabus

Assessment overview

From the 2026–2028 syllabus. Checked against the Cambridge syllabus

All candidates
Paper 1Paper 2
Untiered: all candidates take Paper 1 and Paper 2 (each 50%) and are eligible for grades A* to E.
Assessment objectiveO Level weighting
AO1 Demonstrate knowledge and understanding of the principles and concepts of computer science40%
AO2 Apply knowledge and understanding of the principles and concepts of computer science to a given context, including the analysis and design of computational or programming problems40%
AO3 Provide solutions to problems by evaluating computer systems, making reasoned judgements and presenting conclusions20%
Changes in this syllabus version
  • Same two-paper structure as 2023–2025: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic, each 1 hour 45 minutes, 75 marks and 50%.
  • Two’s complement outcome reworded: represent positive and negative 8-bit integers and convert to and from denary.
  • File-size calculations must use 1024, not 1000 (kibibyte, mebibyte and larger units).
  • More examples of magnetic, optical and solid-state storage added; the FDE abbreviation added to the CPU outcome.
  • Verification now covers the purpose of visual and double entry checks and writing algorithms for them.
  • SQL extended to ORDER BY ascending/descending and the logical operators AND and OR.
  • Version 2 (2024): coding answers on Paper 2 must be in pseudocode, except the 15-mark scenario, which may use pseudocode, Python, Visual Basic or Java.
  • Later versions: operator names updated (v3, v4), procedures and functions may have up to three parameters (v4) and the ROUND function description updated (v6, September 2026).
Command words used in Computer Science papers (13)
Calculate
work out an answer from the facts, figures or information given
Compare
point out or comment on the similarities and/or differences
Define
give the exact meaning
Demonstrate
show how, or give an example
Describe
state the points of a topic or give its characteristics and main features
Evaluate
judge or work out the quality, importance, amount or value of something
Explain
give purposes or reasons, make relationships clear, say why and/or how, backed by relevant evidence
Give
produce an answer from a given source or from recall
Identify
name, select or recognise
Outline
set out the main points
Show (that)
give structured evidence that leads to a given result
State
express in clear terms
Suggest
apply knowledge to a situation with a range of valid answers to make proposals or put forward considerations
Examiner guidance from recent reports (15)
Data representation. For two’s complement, the most significant bit is worth −128, not +128: do not convert the bits to a positive number and simply add a minus sign. File-size answers must use 1024 at every step and be given in the unit asked for; divide by 8 to get from bits to bytes.
Data representation. Read conversion questions carefully: if hexadecimal is asked for, binary is not credited, and hex values need every digit (20 is not the same as 2). Show carries in binary addition when working is requested.
Data transmission. Serial transmission sends bits (not packets) one at a time along a single wire. When describing parity with ARQ, keep the roles clear: the receiver checks, sends a positive or negative acknowledgement, and the sender resends after a negative acknowledgement or a timeout.
Data transmission. Encryption does not stop data being stolen or intercepted – it makes intercepted data meaningless. For symmetric encryption say the same key is used to encrypt and decrypt; for asymmetric, the receiver’s public key encrypts and only the matching private key decrypts.
Hardware. Know exactly which register holds addresses (PC, MAR) and which holds data or instructions (MDR, CIR, ACC). Optical storage is CD, DVD and Blu-ray – a hard disk drive is magnetic. Secondary storage exists inside the computer too; its purpose is non-volatile storage, not just making backups.
Hardware. Answers must fit the device in the question: a keyboard is not a sensible input for a tablet and headphones are not built into one. Valid IPv4 addresses never contain a value above 255.
Software. When asked for an example of system software, name software (an operating system or a utility such as a defragmenter), not a function of the operating system. Firmware is software held in non-volatile memory that starts the hardware and loads the OS – avoid vague answers such as “it runs the computer”. Never use brand names.
The internet and its uses. Be precise: a DDoS attack targets the web server, not “the website”. For a web page request, describe the DNS returning the IP address, the browser requesting the page from the web server and the browser rendering the HTML.
Automated and emerging technologies. Questions about sensors, microprocessors and machine learning are almost always set in a context – use it. Say what the sensor measures, what value the microprocessor compares the reading with, and what signal goes to which actuator, rather than giving a generic list of components.
Algorithm design and problem-solving. Trace tables need a new row each time a value changes, every output, and the dry-run carried right through to the end of the algorithm. When asked for the processes in an algorithm, describe input, processing and output steps – not just its overall purpose.
Algorithm design and problem-solving. For error-finding questions give the line number and the corrected statement; you do not need to copy out the whole line or algorithm. When asked to explain an amendment, explain in words – include the loop that requests re-entry for validation.
Programming. Use the syllabus pseudocode exactly: CASE OF … ENDCASE with OTHERWISE last, OPENFILE/READFILE/WRITEFILE/CLOSEFILE for files, CALL for procedures but not functions, and ← for assignment. Answers written in program code score nothing outside the 15-mark scenario, and keywords must not be used as variable names.
Programming. In the 15-mark scenario, read every bullet, use the arrays and variables named in the question, initialise variables that need it (but do not declare them when told not to), comment your code, give messages for all inputs and outputs, and handle ties when finding a highest or lowest value.
Databases. A field heading such as “Field” is not a data value – choose a primary key only if its values are unique in every record (sometimes none is suitable). In SQL, put text values in quotation marks (e.g. 'Can'), use SUM to total and COUNT to count, and spell field names exactly as given.
Boolean logic. Draw each gate with the standard symbol and no more than two inputs; check the XOR symbol has its extra curved line. Do not simplify an expression unless asked, and when writing an expression from a circuit do not add extra symbols or terms.

Topic map

Practice types

Free sample questions

A graphic designer increases the colour depth of a bitmap image but keeps its resolution the same. Which…
A graphic designer increases the colour depth of a bitmap image but keeps its resolution the same. Which statement is correct?
  1. The image has more pixels, so it can be printed larger without losing detail.
  2. Fewer bits are needed for each pixel, so the file size decreases.
  3. Each pixel can be one of a greater number of colours, and the file size increases.
  4. The image is compressed using lossless compression, so no data is lost.

Answer: C. Each pixel can be one of a greater number of colours, and the file size increases.

Colour depth is the number of bits used for each pixel’s colour. More bits per pixel means more possible colours (2n) and therefore a larger file. The number of pixels (the resolution) has not changed, and nothing has been compressed.

An automated system waters the plants in a greenhouse only when the soil becomes too dry. Which sensor is the…
An automated system waters the plants in a greenhouse only when the soil becomes too dry. Which sensor is the most suitable for deciding when to water the plants?
  1. Moisture sensor
  2. Humidity sensor
  3. Temperature sensor
  4. Light sensor

Answer: A. Moisture sensor

A moisture sensor measures the water content of the soil. A humidity sensor measures water vapour in the air, which is a common confusion. Temperature and light affect how fast soil dries but do not measure whether it is dry.

FAQs

Are these official 2210 past-paper questions?

No. They are original questions written to match the Computer Science syllabus topics. Official past papers are available to schools through Cambridge.

Why choose an exam year?

Cambridge updates syllabuses periodically. Your exam year selects the matching configuration so topics and components follow the right version.

Is a calculator allowed?

It depends on the paper. Each component card shows the calculator rule from this configuration.