# Cambridge 2210 syllabus coverage map

**Reference edition:** Cambridge O Level Computer Science 2210, examinations in 2026, 2027 and 2028, Version 6 (September 2026). This is the official 2210 specification; do not substitute the different 2029–2031 syllabus or assume Version 6 from the 0478 route applies to 2210.

| Syllabus topic | Hero Academics chapter | Lesson range |
|---|---|---|
| 1 Data representation | 01 | 1.1–1.10 |
| 2 Data transmission | 02 | 2.1–2.8 |
| 3 Hardware | 03 | 3.1–3.12 |
| 4 Software | 04 | 4.1–4.7 |
| 5 The internet and its uses | 05 | 5.1–5.8 |
| 6 Automated and emerging technologies | 06 | 6.1–6.6 |
| 7 Algorithm design and problem-solving | 07 | 7.1–7.10 |
| 8 Programming | 08 | 8.1–8.14 |
| 9 Databases | 09 | 9.1–9.10 |
| 10 Boolean logic | 10 | 10.1–10.10 |

## Assessment rules highlighted in the course

- Paper 1 covers Topics 1–6; Paper 2 covers Topics 7–10.
- Each paper is 75 marks, 1 hour 45 minutes, and worth 50% of the qualification.
- No calculators are permitted in either paper.
- For Paper 2 coding questions, candidates are normally required to write Cambridge-style pseudocode; code in another programming language is not awarded marks for those questions.
- The 15-mark scenario question is the exception: pseudocode, Python, Visual Basic or Java may be used.
- Pseudocode formatting should follow the syllabus: uppercase keywords, mixed-case identifiers, four-space indentation for nested blocks, and the prescribed operators and constructs.
- For Boolean logic, teach the exact syllabus gate symbols and complete truth tables for all input combinations. The syllabus limits logic circuits to a maximum of three inputs and one output.

## Scope discipline

The course uses extra everyday examples and optional extensions to aid understanding, but labels them as enrichment rather than examinable requirements. Students should prioritise the stated 2210 syllabus for their exam year.