Subject Guides
Cambridge O Level Computer Science (2210): Subject Overview
An overview of Cambridge O Level Computer Science (2210): the ten syllabus topics, the Computer Systems and Programming papers, and a plan for the year.
- Subject
- Computer Science
- Level
- O LEVELS
- Author
- Marlbridge Academic Team
- 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) combines two kinds of learning. One is understanding computer systems: what happens to data inside a machine and across a network, and what hardware, software and the internet actually do. The other is problem-solving: designing algorithms, writing programs, organising data in databases and reasoning with logic. For examinations in 2026 to 2028 the course is assessed by two written papers that every candidate takes. Paper 1, Computer Systems, and Paper 2, Algorithms, Programming and Logic, are each 105 minutes long, each marked out of 75 and each worth 50% of the final grade.
How the course is organised
The syllabus content is split into ten topics, and the split between the papers is clean: the first six belong to Paper 1 and the last four to Paper 2.
Content for Paper 1: Computer Systems
| Topic | Name | What it includes |
|---|---|---|
| 1 | Data representation | How numbers, characters and media are held as data |
| 2 | Data transmission | Types and methods of data transmission; methods of error detection; encryption |
| 3 | Hardware | Computer architecture; input and output devices; data storage; network hardware |
| 4 | Software | The programs that make hardware useful |
| 5 | The internet and its uses | How the internet operates and what it is used for |
| 6 | Automated and emerging technologies | Automated systems and newer technologies |
These topics reward clear explanation. Much of the challenge is describing a process or a component accurately and in the right terms.
Content for Paper 2: Algorithms, Programming and Logic
| Topic | Name |
|---|---|
| 7 | Algorithm design and problem-solving |
| 8 | Programming |
| 9 | Databases |
| 10 | Boolean logic |
These topics reward method. You are expected to produce and interpret solutions, not only to describe them.
How it’s assessed
| Paper | Title | Length | Marks | Share of grade |
|---|---|---|---|---|
| Paper 1 | Computer Systems | 105 minutes | 75 | 50% |
| Paper 2 | Algorithms, Programming and Logic | 105 minutes | 75 | 50% |
What this means in practice:
- There is a single route through the qualification. Both papers are compulsory and externally assessed, and there is no coursework.
- The course is not tiered. All candidates take the same papers and grades are reported on the A* to E scale.
- Assessment is linear, with both papers sat at the end of the course.
- Paper 1 is made up of short-answer and structured questions on Topics 1 to 6.
- Paper 2 uses short-answer, structured and scenario-based questions on Topics 7 to 10, so expect to meet a described situation and work out a solution for it.
- Calculators are not allowed in either paper.
This O Level shares its ten-topic content and two-paper structure with Cambridge IGCSE Computer Science (0478). The difference in the qualification itself is the grading scale, which for 2210 runs from A* to E.
How the parts fit together
It is tempting to treat Paper 1 as “the theory paper” and Paper 2 as “the coding paper”, but the content overlaps in useful ways.
- Binary links the papers. Data representation in Topic 1 is the foundation for Boolean logic in Topic 10, where every input and output is a one or a zero. Students who are fluent in binary usually find logic circuits far less abstract.
- Logic links to programming. Every condition in an IF statement or a loop is a Boolean expression, so Topic 10 and Topic 8 support one another.
- Algorithms come before code. Topic 7 is about planning and representing a solution, and Topic 8 is about implementing it. Being able to read and correct someone else’s algorithm is as important as writing your own.
- Systems knowledge informs scenarios. A scenario-based question in Paper 2 may describe a real system; understanding how hardware, networks and data storage behave helps you make sensible design choices.
Running through all ten topics are the same habits: precise vocabulary, careful reading of what a question actually asks, and patient, step-by-step working.
Planning your study
The course works best when the two papers’ content is studied in parallel rather than in sequence.
- Theory strand. Work through Topics 1 to 6 in order. Data representation comes first because later topics assume it; transmission and hardware follow; software, the internet and emerging technologies close the strand.
- Problem-solving strand. From the first weeks, set aside regular time for Topic 7 and Topic 8. Short, frequent programming sessions build fluency far better than a late, intensive block.
- Joining the strands. Once binary is secure, study Boolean logic. Once you can write conditions and loops confidently, move on to databases.
A workable year plan has three phases. In the opening phase, cover Topics 1 to 3 and the basics of algorithms and programming. In the middle phase, finish Topics 4 to 6, extend your programming and add Topic 9. In the final phase, complete Topic 10, revisit every topic, and move to full past papers under timed conditions. The course’s exam-preparation page sets out how to approach each paper, so use it once you are ready for paper-level practice.
Using Marlbridge resources for this course
- Study guides are for first learning a topic in depth. The Data representation study guide for 2210 is the natural starting point, and the Programming study guide supports the practical strand.
- Revision notes summarise what you have already learned, for instance the Boolean logic revision notes.
- Practice questions check understanding one topic at a time, such as the Algorithm design and problem-solving practice questions.
- Exam preparation: the paper-by-paper exam preparation guide covers Paper 1 and Paper 2 separately.
- Past papers: the 2210 past papers page collects grade threshold and examiner report notes to use alongside real past papers.
Frequently asked questions
What is assessed in Cambridge O Level Computer Science 2210? Two compulsory written papers: Paper 1 Computer Systems on Topics 1 to 6, and Paper 2 Algorithms, Programming and Logic on Topics 7 to 10. Each is 105 minutes, 75 marks and 50% of the grade.
Is there coursework in O Level Computer Science 2210? No. The two externally assessed papers make up the whole qualification.
How is O Level 2210 related to IGCSE 0478? They share the same ten topics and the same two-paper structure. O Level 2210 is graded A* to E.
Are calculators allowed? No. Neither paper permits a calculator, so practise conversions and calculations by hand.
When does this syllabus apply? This page describes the 2026-2028 syllabus, first assessed in 2026.
Source
Cambridge International, Cambridge O Level Computer Science 2210 syllabus for 2026-2028
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.
Related resources
-
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.
Computer Science · Cambridge · O Level
Read guide -
Study guides
Cambridge O-Level Computer Science: Data Representation (2210)
Guide to Topic 1 of Cambridge O Level Computer Science 2210 (2026-2028): binary, hex, overflow, two's complement, text, sound, images and compression.
Computer Science · Cambridge · O Level
Read guide -
Study guides
Cambridge O-Level Computer Science: Data Transmission (2210)
Guide to Topic 2 of Cambridge O Level Computer Science 2210: packets and packet switching, transmission methods, USB, error detection, ARQ and encryption.
Computer Science · Cambridge · O Level
Read guide
Related articles
-
teaching
A Level tuition in Dubai: Cambridge or Pearson Edexcel International A Level?
Schools in Dubai and Abu Dhabi teach either Cambridge International AS & A Level or Pearson Edexcel International A Level. How the two are structured, why it matters for tuition, and how online classes from Lahore work.
9 October 2026
-
curriculum guides
Choosing subjects at IGCSE and A Level
How subject choices at 14 and 16 affect university options later, and how to keep pathways open without overloading a timetable.
28 July 2026
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