Skip to content
Marlbridge

Exam Preparation

Cambridge O Level Computer Science: Paper-by-Paper Exam Preparation

How to prepare for the two Cambridge O Level Computer Science 2210 papers: Computer Systems and Algorithms, Programming and Logic, with timing and a trace-table example.

Level
O LEVELS
Topic
Exam preparation – Papers 1 and 2
Updated

Aligned to Cambridge O Level Computer Science (2210), 2026-2028. Official specification .

Syllabus page (what it covers and how it is assessed): Cambridge O Level Computer Science.

Found an error? Report a correction.

Need help with this topic? Request a free trial class for O Level Computer Science (2210).

Cambridge O Level Computer Science (2210) is assessed by two compulsory papers and is not tiered. Paper 1 Computer Systems lasts 1 hour 45 minutes, carries 75 marks and is worth 50%. Paper 2 Algorithms, Programming and Logic is also 1 hour 45 minutes, 75 marks and 50%. Both are externally assessed and no calculators are permitted. Plan your revision around topic pages such as data representation, data transmission and Boolean logic.

Paper 1: Computer Systems

According to the verified record, Paper 1 covers Topics 1 to 6 and uses short-answer and structured questions. The topics are data representation, data transmission, hardware, software, the internet and its uses, and automated and emerging technologies. It lasts 1 hour 45 minutes for 75 marks and is worth 50%.

Because calculators are not permitted, conversions between binary, denary and hexadecimal must be done by hand, so practise them until they are routine. For hardware and software questions, learn the purpose of each component or program type, not just its name. For transmission and internet topics, be ready to describe a process step by step. Short-answer questions usually reward a precise term plus a brief reason; structured questions often move from simple recall to application in a stated context, so read the scenario in every part.

Paper 2: Algorithms, Programming and Logic

Paper 2 covers Topics 7 to 10: algorithm design and problem-solving, programming, databases and Boolean logic. Per the record it uses short-answer, structured and scenario-based questions. It is the same length and mark total as Paper 1 and carries the same 50% weighting.

Scenario-based questions give you a described situation and ask you to design, complete or correct a solution. Practise reading a problem and identifying the inputs, processing and outputs before writing anything. Rehearse tracing algorithms with a table, completing partly written code, writing logic expressions and drawing or reading logic circuits and truth tables. Revisit algorithm design and its revision notes for the standard techniques. Since there is no calculator, any arithmetic in a trace must be done carefully by hand.

Timing and marks per minute

Both papers have the same arithmetic: 105 minutes for 75 marks is 105 / 75 = 1.4 minutes per mark. A 3-mark question should take about 4.2 minutes and a 6-mark question about 8.4 minutes. Together the weightings are 50% + 50% = 100%, so neither paper can be neglected: a weaker result on one cannot be offset by ignoring the other in revision.

Reserve around ten minutes at the end of each paper to check trace tables, bit patterns and logic expressions. Many marks in this subject are lost through small slips rather than conceptual gaps.

Command words and question styles

State, give and name need one fact. Describe needs a sequence or a set of features. Explain needs a reason. Complete asks you to fill in a table, code or diagram. Trace means to follow the values through an algorithm, recording each change. Write or design means to produce your own solution. Identify and correct errors means to find the flaw and supply a fix. Whatever the verb, tie your answer to the context in the question, because generic definitions earn fewer marks in scenario questions.

When writing code or pseudocode, follow the conventions given in the specification and in your classroom materials, keep indentation consistent and choose meaningful identifier names. Check the official syllabus for exactly which pseudocode or programming conventions are expected in the examination.

Worked practice scenario

An algorithm sets Total to 0 and Count to 0. It then examines each value in the list 7, 12, 5, 20, 9 in turn. If the value is greater than 8, it adds the value to Total and adds 1 to Count. At the end it outputs Total and Count.

Trace table.

Value Value greater than 8? Total Count
start 0 0
7 No 0 0
12 Yes 12 1
5 No 12 1
20 Yes 32 2
9 Yes 41 3

Output: Total = 41 and Count = 3.

Follow-up. What is the purpose of the algorithm? It calculates the sum and the number of values that exceed 8. Extending it to find their average would require dividing Total by Count, giving 41 / 3, which is about 13.67 (a division the candidate would carry out by hand). Always guard against Count being 0 before dividing.

The marks in a trace question come from every changed value being recorded in the right row, so do not skip rows.

Before/during exam checklist

  • Make a list of Topics 1 to 10 and mark which paper each belongs to.
  • Practise binary, denary and hexadecimal conversion without a calculator.
  • Trace at least a dozen algorithms by hand, including ones with loops and conditions.
  • Learn to draw logic gates and complete truth tables accurately.
  • Read each scenario twice and underline the inputs and outputs.
  • Write out all intermediate values in trace tables.
  • Keep to about 1.4 minutes per mark and move on if stuck.
  • Use the last ten minutes to check arithmetic and logic.

Self-test

  1. Which topics does each paper cover?
  2. How many minutes per mark does each paper allow?
  3. Are calculators allowed?
  4. What is each paper’s weighting?
  5. In the worked scenario, why is the value 9 counted?

Answers: 1. Paper 1 covers Topics 1 to 6 and Paper 2 covers Topics 7 to 10. 2. 105 / 75 = 1.4 minutes per mark. 3. No, calculators are not permitted on either paper. 4. 50% each. 5. Because 9 is greater than 8, so it is added to Total and Count increases to 3.

Frequently asked questions

How many papers are there in Cambridge O Level Computer Science 2210? Two, both compulsory: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic.

How long and how many marks is each paper? Each is 1 hour 45 minutes and 75 marks, and each carries 50%.

Can I use a calculator? No. According to the verified record, calculators are not permitted on either paper.

Is the subject tiered? No. It is not tiered, and the grade range is A* to E.

Does this share content with another qualification? The record notes that it shares its ten-topic content and two-component structure with IGCSE 0478. Check the official syllabus for details.

Written against Cambridge O Level Computer Science 2210 (assessment structure verified 2026-08-27). The worked scenario is an original example, not a reproduction of any official past or sample paper question. Always check the current specification for your examination year at Cambridge International website.

Get free revision emails (optional)

Occasional emails with practice questions, worked explanations and links to free resources for the qualification and subjects you choose. No spam, and you can unsubscribe from any email. The free tools on this site never need an email.

Subjects (optional, up to 6)

Choose a qualification to see its subjects.

Related resources

Related articles

Studying this with a teacher

Working through Computer Science O LEVELS?

This page is free and stays free. If you would rather be taught it, Marlbridge runs Computer Science classes one-to-one and in small groups of up to 15, online in your own time zone. The first trial class is free. WhatsApp replies within an hour (8am–11pm Pakistan time, every day); email the same day.

Cambridge Computer Science teachers at Marlbridge