- For 2026–2028, Cambridge O Level Computer Science 2210 has two papers: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic, each 1 hour 45 minutes, 75 marks and 50% of the grade.
- For 2026–2028, 2210 Paper 2 coding answers must be in pseudocode, except the 15-mark scenario question, which may be answered in pseudocode, Python, Visual Basic or Java.
- From 2029, O Level Computer Science 2210 Paper 2 programming answers must be written in Python 3.10 or higher, and calculators are allowed in Paper 2.
- The 2210 syllabus has ten topics: six computer systems topics on Paper 1 and four on Paper 2 (algorithm design and problem-solving, programming, databases and Boolean logic).
- The 2029–2031 2210 syllabus adds content such as IPv4/IPv6 addressing, cookies, cloud models, machine learning and quantum computing, and removes digital currency and image and sound file-size calculations.
On this page
- How is O Level Computer Science 2210 assessed?
- What changes in O Level Computer Science from 2029?
- What theory topics are on Paper 1?
- How do you write pseudocode and programs for Paper 2?
- How should you tackle the 15-mark scenario question?
- What does a good O Level Computer Science revision plan look like?
O Level Computer Science 2210 is assessed by two equally weighted papers: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic, each 1 hour 45 minutes and 75 marks. Success depends on two different skills: accurate theory recall for Paper 1 and practical algorithm writing for Paper 2. From 2029 the programming language for Paper 2 becomes Python only, so check which syllabus covers your exam year.
How is O Level Computer Science 2210 assessed?
O Level Computer Science 2210 is assessed by two written papers, each lasting 1 hour 45 minutes, worth 75 marks and carrying 50% of the qualification. There is no coursework, and grades run from A* to E. Paper 1 tests computer systems theory; Paper 2 tests algorithms, programming, databases and logic.
| Syllabus (exam years) | Paper | Time | Marks | Weighting |
|---|---|---|---|---|
| 2026–2028 | Paper 1 Computer Systems | 1 h 45 min | 75 | 50% |
| 2026–2028 | Paper 2 Algorithms, Programming and Logic | 1 h 45 min | 75 | 50% |
| 2029–2031 | Paper 1 Computer Systems and Logic | 1 h 45 min | 75 | 50% |
| 2029–2031 | Paper 2 Algorithms and Programming | 1 h 45 min | 75 | 50% |
The assessment objectives are AO1 knowledge and understanding (40%), AO2 applying knowledge to a context, including designing programming solutions (40%), and AO3 evaluating and making reasoned judgements (20%). See the Cambridge O Level Computer Science 2210 page for the syllabus for your year.
What changes in O Level Computer Science from 2029?
From 2029, the 2210 papers are renamed Paper 1 Computer Systems and Logic and Paper 2 Algorithms and Programming, and all Paper 2 programming answers must be written in Python 3.10 or higher. Pseudocode is no longer required from candidates, calculators are allowed in Paper 2, and the 15-mark scenario question is split into sub-parts with points-based marking.
- New or expanded: IPv4 and IPv6 with static and dynamic addressing, session and persistent cookies, public, private and hybrid cloud, cybersecurity principles, machine learning, neural networks, AI ethics and bias, and quantum computing at a conceptual level.
- Removed: image and sound file-size calculations, PiB and EiB, the USB interface, legacy media, digital currency and explicit coverage of the program development life cycle.
- Moved: logic gates and circuits move to Paper 1.
If you sit in 2026, 2027 or 2028, pseudocode is still the main language for Paper 2 answers. Students starting the course for 2029 should practise in Python from the beginning.
What theory topics are on Paper 1?
Paper 1 covers six topics: data representation, data transmission, hardware, software, the internet and its uses, and automated and emerging technologies. Most questions ask you to define, describe or explain, often applied to a short scenario, with some number conversions and calculations.
| Topic | Key content to master |
|---|---|
| Data representation | Binary, denary, hexadecimal; binary addition and overflow; logical shifts; two's complement; text, sound and image representation; compression |
| Data transmission | Packets and packet switching; serial and parallel; error detection; symmetric and asymmetric encryption |
| Hardware | CPU, the fetch–decode–execute cycle, cores, cache, clock; input, output and storage devices; network hardware |
| Software | System and application software, operating systems, interrupts, high- and low-level languages, compilers and interpreters |
| The internet and its uses | The web, URLs, HTTP and HTTPS, browsers, cookies, cyber security threats and solutions |
| Automated and emerging technologies | Sensors, microprocessors and actuators; robotics; artificial intelligence |
How do you write pseudocode and programs for Paper 2?
Write Paper 2 algorithms using Cambridge-style pseudocode: upper-case keywords, ← for assignment, and paired keywords such as IF…ENDIF, FOR…NEXT and REPEAT…UNTIL. Examiners credit correct logic, so clear structure, meaningful variable names and indentation help your answer get every mark it deserves.
Paper 2 also covers algorithm design (decomposition, structure diagrams and flowcharts), standard methods such as totalling, counting, linear search and bubble sort, validation and verification, trace tables, one-dimensional and two-dimensional arrays, procedures and functions, SQL queries on a single-table database, and logic gates with truth tables. For a detailed look at pseudocode conventions and trace tables, read our pseudocode and trace table guide; the IGCSE and O Level syllabuses share the same content structure.
Worked example: validation and averages
This original algorithm asks for marks for 10 students, rejects any mark outside 0–100, and outputs the average and the number of passes (50 or more).
Total ← 0
Passes ← 0
FOR Student ← 1 TO 10
REPEAT
OUTPUT "Enter a mark from 0 to 100"
INPUT Mark
UNTIL Mark >= 0 AND Mark <= 100
Total ← Total + Mark
IF Mark >= 50
THEN
Passes ← Passes + 1
ENDIF
NEXT Student
OUTPUT "Average: ", Total / 10
OUTPUT "Passes: ", PassesThe REPEAT…UNTIL loop is a range check: it keeps asking until the input is valid, so an invalid mark never reaches the total. The same logic in Python, which 2029 candidates will need, looks like this:
total = 0
passes = 0
for student in range(10):
mark = int(input("Enter a mark from 0 to 100: "))
while mark < 0 or mark > 100:
mark = int(input("Invalid. Enter 0 to 100: "))
total = total + mark
if mark >= 50:
passes = passes + 1
print("Average:", total / 10)
print("Passes:", passes)Notice the condition changes: the pseudocode repeats until the mark is valid, while the Python while loop runs while the mark is invalid. Getting this logic the right way round is exactly what examiners test.
How should you tackle the 15-mark scenario question?
Tackle the 15-mark scenario question by listing every requirement in the task, then writing a complete program that meets them in order, with validation, clear outputs and comments. For 2026–2028 the question is marked as a whole, so a full, readable solution usually outscores a partial one with clever details.
- Use the exact array and variable names given in the question, and do not redeclare data it says is already stored.
- Validate every input the task mentions, using a loop that repeats until the value is acceptable.
- Keep the standard methods ready: totalling, counting, finding the highest and lowest, and searching an array.
- Output results with labels so the examiner can see what each value means.
- Write in one language only. Pseudocode is the safest choice if that is what you practise most.
What does a good O Level Computer Science revision plan look like?
A good 2210 revision plan covers the six Paper 1 topics and the four Paper 2 topics in parallel over about eight weeks, with programming practice every week, and finishes with timed papers. Programming improves with steady practice, so do not leave Paper 2 until the end.
| Weeks | Paper 1 focus | Paper 2 focus |
|---|---|---|
| 1–2 | Data representation and transmission | Standard methods: totalling, counting, max/min, averages |
| 3–4 | Hardware and software | Validation, linear search, bubble sort, trace tables |
| 5–6 | The internet; automated and emerging technologies | Arrays, procedures and functions, SQL, logic gates |
| 7–8 | Timed Paper 1 practice and review | Timed Paper 2 practice, including a full scenario question |
Quiz Portal's O Level Computer Science 2210 page has original topical questions and timed mocks for both papers, with results for practice rather than official marks. Use them alongside past papers from your school, marked with the official mark scheme, and see our guide to O Level topical practice for how to combine the two.
Frequently asked questions
Is O Level Computer Science 2210 Python only?
Not until 2029. For 2026–2028, Paper 2 coding answers must be in pseudocode, except the 15-mark scenario question, which may use pseudocode, Python, Visual Basic or Java. From 2029, all Paper 2 programming answers must be in Python 3.10 or higher.
How many papers are in O Level Computer Science 2210?
There are two papers, each 1 hour 45 minutes long and worth 75 marks: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic. Each counts for 50% of the grade.
Is O Level Computer Science 2210 the same as IGCSE 0478?
The two syllabuses share the same topics and paper structure, but they are separate qualifications: 2210 is a Cambridge O Level graded A* to E, and 0478 is a Cambridge IGCSE graded A* to G.
Is there coursework in O Level Computer Science?
No. O Level Computer Science 2210 is assessed only by the two written papers. Practical programming skills are tested through Paper 2.
Which topics are removed from O Level Computer Science in 2029?
The 2029–2031 syllabus removes image and sound file-size calculations, PiB and EiB, the USB interface, legacy media, digital currency and explicit coverage of the program development life cycle.
Quiz Portal is independent and is not affiliated with Cambridge University Press & Assessment or College Board. Practice questions in this guide are original.