Skip to content
O Level 2210 · IGCSE 0478 · exams 2029–2031

The 2029–2031 syllabus

Cambridge has rewritten O Level and IGCSE Computer Science for exams from June 2029. If you start the course in September 2027 or later, this is the syllabus you will sit: Paper 2 is answered in Python only, the content is reorganised into 11 topics, and AI, quantum computing and two-table SQL arrive. Sitting your exams in 2026, 2027 or 2028? Nothing here applies to you yet — keep using the current O Level course.

Who it applies to

You sit the 2029–2031 syllabus if…

your O Level 2210 or IGCSE 0478 exams are in 2029, 2030 or 2031 — normally everyone who starts the two-year course in September 2027 or later.

You stay on the 2026–2028 syllabus if…

your exams are in 2026, 2027 or 2028 (last series November 2028). Everything else on this site — notes, quizzes, pseudocode — is built for you.

  1. Sep 2026

    Cambridge publishes the 2029–2031 syllabus (Version 1) and specimen papers.

  2. September 2027

    New O Level / IGCSE classes start on the 2029–2031 syllabus (a two-year course ending in 2029).

  3. Sep 2027 – Nov 2028

    Two editions live at once: students already in the course still sit the 2026–2028 papers.

  4. November 2028

    Last exams on the 2026–2028 syllabus.

  5. March 2029

    First 0478 exams on the new syllabus — March series, schools in India only.

  6. June 2029

    First 2210 and 0478 exams on the new syllabus. It runs until November 2031.

Exam years, series and zones are from the syllabus; the September 2027 start is the usual two-year course and is not printed by Cambridge. O Level 2210 is available in administrative zones 3, 4 and 5; IGCSE 0478 in the June and November series everywhere, plus March in India.

The two papers

Paper 1 · Topics 1–7

Computer Systems and Logic

1 hour 45 minutes75 marks50%No calculator

Short-answer and structured questions. All questions are compulsory.

Assessment objectives: AO1 60% · AO2 20% · AO3 20%

Paper 2 · Topics 8–11

Algorithms and Programming

1 hour 45 minutes75 marks50%Calculator allowed

Short-answer and structured questions and a scenario-based question. All questions are compulsory. Programs are designed and written in Python 3.10 or higher.

Assessment objectives: AO1 20% · AO2 60% · AO3 20%

The scenario question. The final question in Paper 2 presents an unseen scenario: candidates write Python 3.10 or higher for the context given, using the methods and concepts of Topics 8–11. It has multiple parts totalling 15 marks, and about 30 minutes should be spent on it. The mark scheme is points-based, not levels-based.

Grades: 2210 A* to E, 0478 A* to G. New command word: Convert — “to change a number from one number system (base) to another”. See all command words.

Paper 2 is Python 3.10+

All programming responses in Paper 2 must be written in Python 3.10 or higher. Pseudocode is no longer required (Cambridge notes an awareness of its purpose is still valuable). The syllabus prints a Python 3.10 guide showing how Python appears in the exams. The Python you need: variables and casting, if / elif / else and match-case, for and while (with break for a post-condition loop), string methods, 1D and 2D lists, functions and procedures, local and global scope, and file handling with with open().

What changes from 2026–2028

Items marked Cambridge are on the syllabus's own “Changes” page; the rest we found by comparing the two content lists line by line. § numbers: was = 2026–2028, now = 2029–2031.

Assessment3

  • Paper 2 is Python onlyCambridge

    All programming responses in Paper 2 must be written in Python 3.10 or higher. Pseudocode is no longer required, though Cambridge says an awareness of its purpose is still valuable.

    was §Topic 7, 8.1–8.3now §8–108. Programming7. Algorithm Design and Problem-Solving

  • Scenario question in sub-parts, points-basedCambridge

    The 15-mark scenario question (last on Paper 2, ~30 minutes) is now several separate sub-parts, marked point by point instead of by levels.

    now §Paper 28. Programming7. Algorithm Design and Problem-Solving

  • Papers renamed and re-cutCambridge

    Paper 1 is now Computer Systems and Logic (Topics 1–7, no calculator); Paper 2 is Algorithms and Programming (Topics 8–11, calculator allowed). Logic gates and circuits move from Paper 2 to Paper 1.

    10. Boolean Logic

New14

  • IPv4 and IPv6Cambridge

    32-bit dotted-denary vs 128-bit colon-hex addresses — their features and differences.

    was §3.4now §3.33. Hardware

  • Static and dynamic IP addressesCambridge

    Fixed addresses for servers vs temporary ones allocated by an ISP or home router.

    was §3.4now §3.33. Hardware

  • Cloud storage modelsCambridge

    Public, private and hybrid cloud storage and when each would be used, on top of cloud vs local storage.

    was §3.3now §3.43. Hardware

  • Quantum computersCambridge

    Quantum vs classical computing at a conceptual level (bits, qubits, electrons/photons) and their pros and cons — no quantum theory.

    now §7.26. Automated and Emerging Technologies

  • New command word: ConvertCambridge

    “To change a number from one number system (base) to another.”

    was §1.1now §1.11. Data Representation

  • Cyclic shifts

    Cyclic left and right shifts of multiple places, alongside logical shifts.

    was §1.1now §1.11. Data Representation

  • Huffman coding

    Lossless compression now names Huffman coding next to RLE (no Huffman trees).

    was §1.3now §1.31. Data Representation

  • New threats and defences

    SQL injection, ransomware/adware, TLS, VPN and automated software updates are named.

    was §5.3now §4.25. The Internet and Its Uses

  • IDE: prettyprint and AI assistance

    The IDE feature list adds run-time environment, prettyprint and AI assistance.

    was §4.2now §5.24. Software

  • Microcontrollers

    A microcontroller (not a microprocessor) now drives automated systems.

    was §6.1now §6.16. Automated and Emerging Technologies

  • Abstraction

    Abstraction gets its own sub-section next to decomposition.

    was §Topic 7now §9.17. Algorithm Design and Problem-Solving

  • Binary search, insertion sort and merge sort

    Performed on data, described and compared with linear search and bubble sort (no Big-O).

    was §Topic 7now §9.37. Algorithm Design and Problem-Solving

  • match-case and Python library functions

    match-case selection, string methods and sum/max/min/mean/round/random functions.

    was §8.1now §8.1, 10.28. Programming

  • Two-table databases and INNER JOIN

    Foreign keys, joining two tables, INSERT INTO and correcting SQL statements; currency and decimal data types.

    was §Topic 9now §11.1–11.29. Databases

Expanded4

  • Session and persistent cookiesCambridge

    Now named explicitly, next to cookies as small text files kept by the browser.

    was §5.1now §3.45. The Internet and Its Uses

  • Core principles of cybersecurityCambridge

    Confidentiality, integrity, authenticity, availability and non-repudiation — how each is threatened and how encryption supports them.

    was §5.3now §4.25. The Internet and Its Uses2. Data Transmission

  • Artificial intelligenceCambridge

    Supervised, unsupervised and reinforcement learning; neural network layers; applications (recommendations, LLMs, generative AI, computer vision, predictive analytics); fairness, bias, ethics and implications.

    was §6.3now §7.16. Automated and Emerging Technologies

  • What the operating system does

    User accounts, file systems, memory (paging, segmentation, protection), process scheduling, drivers and resuming after an interrupt.

    was §4.1now §5.14. Software

Removed10

  • File-size calculationsCambridge

    No more calculating bitmap image or sound file sizes.

    was §1.2–1.31. Data Representation

  • PiB and EiBCambridge

    Storage units stop at the tebibyte (TiB).

    was §1.31. Data Representation

  • The USB interfaceCambridge

    Explicit coverage of USB has gone.

    was §2.12. Data Transmission

  • Legacy media and storageCambridge

    Legacy media devices and storage are no longer in the syllabus (secondary storage is magnetic and solid-state only).

    was §3.33. Hardware

  • Automated systems in any settingCambridge

    Automated systems are limited to named areas (the change list names transport, agriculture, domestic settings, retail, industry and medicine; 6.1.8 lists the first four, 6.2.3 puts robots in industry, agriculture and medicine).

    was §6.1now §6.1–6.26. Automated and Emerging Technologies

  • Digital currencyCambridge

    The whole digital currency / blockchain topic has been removed.

    was §5.25. The Internet and Its Uses

  • Program development life cycleCambridge

    No explicit reference to the PDLC (analysis, design, coding, testing).

    was §Topic 77. Algorithm Design and Problem-Solving

  • PseudocodeCambridge

    Candidates no longer write pseudocode; algorithms are written as flowcharts or Python.

    was §Topic 7, 87. Algorithm Design and Problem-Solving8. Programming

  • Expert systems

    Knowledge base / rule base / inference engine are no longer listed; AI is taught through machine learning and neural networks.

    was §6.3now §7.16. Automated and Emerging Technologies

  • Structure diagrams

    Algorithms are designed with flowcharts or Python only.

    was §Topic 7now §9.37. Algorithm Design and Problem-Solving

Moved10

  • Binary limit 12 bits

    Number-base conversions use at most 12-bit binary values.

    was §1.1now §1.11. Data Representation

  • Logic gates join Paper 1

    Gate symbols and functions sit in 1.1; circuits, truth tables and expressions become 2.1.

    was §Topic 10now §1.1, 2.110. Boolean Logic

  • NIC, MAC address and router

    Network hardware moves into data transmission and IP addressing.

    was §3.4now §3.2–3.33. Hardware

  • Embedded systems

    Embedded systems move next to microcontrollers, sensors and actuators.

    was §3.1now §6.13. Hardware6. Automated and Emerging Technologies

  • Sensors and actuators

    Sensors (with the ADC) and actuators are taught through automated systems; the input and output device lists are gone.

    was §3.2now §6.13. Hardware

  • Error detection and cybersecurity

    Parity, checksum, echo check, check digits and ARQ join the cybersecurity threats and defences in one topic.

    was §2.2, 5.3now §4.1–4.22. Data Transmission5. The Internet and Its Uses

  • Encryption

    Symmetric and asymmetric encryption move into cybersecurity.

    was §2.3now §4.22. Data Transmission

  • Validation, verification and test data

    Now written in Python; test data is normal, boundary and erroneous.

    was §Topic 7now §10.57. Algorithm Design and Problem-Solving

  • Arrays become Python lists

    1D and 2D lists from index zero with append, insert, pop, sort and membership.

    was §8.2now §10.38. Programming

  • File handling in Python

    open/with open, modes r, w and a, read/readline/readlines/write.

    was §8.3now §10.48. Programming

The 11 topics 30 sub-sections · 183 learning objectives

Paper 1 · Computer Systems and Logic

1. Data representation and logic gates1.1 · 1.2 · 1.3

1.1 Number systems and logic gates

  • 1.1.1Know that computers internally represent all data in binary
  • 1.1.2Know that data is converted to binary, processed using logic gates
  • 1.1.3Identify and use the standard symbols for logic gates
  • 1.1.4Demonstrate the function of each logic gate limited to: NOT · AND · OR · NAND · NOR · XOR
  • 1.1.5Know how data storage is measured, limited to: bit · nibble · byte · kibibyte (KiB) · mebibyte (MiB) · gibibyte (GiB) · tebibyte (TiB)
  • 1.1.6Convert between each data storage measurement in 1.1.5
  • 1.1.7Know the base of the denary, binary and hexadecimal number systems
  • 1.1.8Convert between: denary and binary · denary and hexadecimal · hexadecimal and binary
  • 1.1.9Explain the advantages of using hexadecimal as an understandable representation of binary and identify examples where hexadecimal is used
  • 1.1.10Add two positive 8-bit binary integers
  • 1.1.11Describe overflow and how it can create errors in binary addition
  • 1.1.12Perform logical left and right shifts of multiple places on a positive 8-bit binary integer
  • 1.1.13Explain the effects of logical left and right shifts
  • 1.1.14Perform cyclic left and right shifts of multiple places on a positive 8-bit binary integer
  • 1.1.15Explain the effects of cyclic left and right shifts
  • 1.1.16Convert positive and negative binary or denary integers to their two's complement 8-bit representation
  • 1.1.17Convert two's complement 8-bit integers back to binary or denary

Logic gates will be limited to a maximum of two inputs

Conversions in both directions, positive integers only, maximum binary number length of 12 bits

1.2 Text, sound and images

  • 1.2.1Know that computers store characters as binary numbers
  • 1.2.2Understand that a character set is a set of characters that have corresponding numeric codes
  • 1.2.3Describe how a computer represents text using character sets
  • 1.2.4Describe the features of the character sets: American Standard Code for Information Interchange (ASCII) · Unicode
  • 1.2.5Describe the advantages and disadvantages of: ASCII · Unicode
  • 1.2.6Describe how a computer represents analogue sound, including: sample rate · sample resolution
  • 1.2.7Explain the effects of changing the sample rate and sample resolution
  • 1.2.8Know that a bitmap image is made up of pixels
  • 1.2.9Describe how a computer uses binary to represent a bitmap image, including: resolution · colour depth
  • 1.2.10Explain the effects of changing the resolution or the colour depth on a bitmap image

1.3 Data compression

  • 1.3.1Explain the purpose of data compression for transmission and storage
  • 1.3.2Explain the impact of data compression for transmission and storage
  • 1.3.3Explain how images, sound and video files are compressed using lossy compression methods
  • 1.3.4Explain how text, images, video and sound files are compressed using the lossless compression methods of run length encoding (RLE) and Huffman coding
  • 1.3.5Describe the advantages and disadvantages of lossy and lossless compression methods and identify where each method would be appropriate from a given scenario

Candidates will not be required to create or interpret a Huffman tree

Closest current topics: 1. Data Representation, 10. Boolean Logic

2. Logic circuits and hardware2.1 · 2.2 · 2.3

2.1 Logic circuits

  • 2.1.1Use logic gates to create logic circuits from a: problem statement · logic expression · truth table
  • 2.1.2Complete a truth table from a: problem statement · logic expression · logic circuit
  • 2.1.3Write a logic expression from a: problem statement · logic circuit · truth table

Circuits must be created for the statement given, without simplification

Logic circuits will be limited to a maximum of three inputs and one output

2.2 CPU architecture

  • 2.2.1Describe the role of the central processing unit (CPU) in a computer
  • 2.2.2Describe a microprocessor as a type of integrated circuit on a single chip
  • 2.2.3Describe the purpose of the components in a CPU, limited to the: arithmetic logic unit (ALU) · control unit (CU) · program counter (PC) · memory address register (MAR) · memory data register (MDR) · current instruction register (CIR) · accumulator (ACC) · address bus · data bus · control bus · cache · cores · clock
  • 2.2.4Describe the roles of the central processing unit (CPU) and random access memory (RAM) in the von Neumann architecture
  • 2.2.5Describe the process of the fetch–decode–execute (FDE) cycle, including the role of each component in the CPU, in a computer that has a von Neumann architecture
  • 2.2.6Explain how the number of cores, size of the cache and the clock speed can affect the performance of a CPU
  • 2.2.7Describe the purpose of an instruction set for a CPU

2.3 Data storage

  • 2.3.1Explain the purpose and the role of primary storage in a computer, limited to: random access memory (RAM) · read only memory (ROM) · cache · registers
  • 2.3.2Describe the similarities and differences between RAM and ROM
  • 2.3.3Explain the purpose and the role of secondary storage in a computer
  • 2.3.4Describe the similarities and differences between primary and secondary storage
  • 2.3.5Describe the operation of magnetic and solid-state storage, including how data is read from and written to each type of storage
  • 2.3.6Explain the differences between magnetic, and solid-state storage
  • 2.3.7Describe how virtual memory is created and used
  • 2.3.8Explain why virtual memory is necessary

Closest current topics: 10. Boolean Logic, 3. Hardware

3. Data transmission and networking3.1 · 3.2 · 3.3 · 3.4

3.1 Packet switching

  • 3.1.1Understand that data is separated into packets to be transmitted
  • 3.1.2Describe the structure of a data packet, limited to: the packet header · the payload · the trailer
  • 3.1.3State what is included in the packet header, the payload and the trailer
  • 3.1.4Describe the process of packet switching, including: packets can take different routes · routers make forwarding decisions · at the destination packets are reassembled

3.2 Data transmission

  • 3.2.1Describe how data is transmitted from one device to another using different methods of data transmission, limited to: serial · parallel · simplex · half-duplex · full duplex
  • 3.2.2Identify typical applications for each of the transmission methods in 3.2.1
  • 3.2.3Explain the suitability, advantages and disadvantages of the transmission methods in 3.2.1
  • 3.2.4Describe the purpose of a network interface card (NIC)
  • 3.2.5Describe the format and purpose of a media access control (MAC) address
  • 3.2.6State that each NIC has a unique identifier (MAC address)
  • 3.2.7Describe the function of a switch limited to storing the MAC addresses of connected devices

3.3 Internet Protocol Addresses

  • 3.3.1Describe the purpose of an internet protocol (IP) address in uniquely identifying networks and devices on the internet
  • 3.3.2Describe the format of an IP address
  • 3.3.3Explain the features of and the differences between IPv4 and IPv6 addressing, including: IPv4 uses 32-bit addresses (written as four sets of denary numbers, separated by dots) · IPv6 uses 128-bit addresses (written as eight sets of hexadecimal numbers, separated by colons)
  • 3.3.4Explain the features of and the differences between static and dynamic IP addresses, including: static IP addresses remain fixed and are often used for servers or hosting services · dynamic IP addresses are allocated temporarily by an ISP or home router when a device connects to the internet
  • 3.3.5Describe the functions of a router

3.4 The Internet and the World Wide Web

  • 3.4.1Describe the purpose of a uniform resource locator (URL)
  • 3.4.2Describe the structure of a URL
  • 3.4.3Describe the purpose and operation of hypertext transfer protocol (HTTP) as the protocol for requesting and delivering web resources
  • 3.4.4Describe the purpose and operation of hypertext transfer protocol secure (HTTPS) as a secure version of HTTP that uses encryption to ensure secure communication
  • 3.4.5Describe how web pages are located, retrieved and displayed on a device when a user inputs a URL, including the role of: the web browser · IP addresses · domain name system (DNS) · the webserver · hypertext markup language (HTML)
  • 3.4.6Understand the role of the DNS in translating human-readable domain names into IP addresses so that browsers can locate web servers to make HTTP requests
  • 3.4.7Understand that cookies are small text files that store pieces of data stored by a web browser
  • 3.4.8Explain the difference between session cookies and persistent cookies
  • 3.4.9Describe the features of the cloud and cloud services
  • 3.4.10Explain the advantages and disadvantages of storing data on the cloud in comparison to storing data locally
  • 3.4.11Explain the difference between cloud storage models and when they would be used, limited to: public · private · hybrid

Closest current topics: 2. Data Transmission, 3. Hardware, 5. The Internet and Its Uses

4. Data integrity and cybersecurity4.1 · 4.2

4.1 Data integrity

  • 4.1.1Describe how errors can occur during data storage, data transmission and data entry
  • 4.1.2Describe how methods detect errors and how errors are corrected, including: parity bit (odd and even) · parity block check (odd and even) · echo check · checksum · check digit
  • 4.1.3Calculate a parity bit or parity byte for a given piece of binary data
  • 4.1.4Identify examples of when a check digit is used, including: International Standard Book Number (ISBN) · bar codes · airline tickets · bank account numbers
  • 4.1.5Describe how an automatic repeat reQuest (ARQ) can be used to acknowledge whether data is received without error, including the use of positive and negative acknowledgements

Candidates will not be required to calculate a check digit or checksum

4.2 Cybersecurity

  • 4.2.1State the core principles of cybersecurity as: confidentiality · integrity · authenticity · availability · non-repudiation
  • 4.2.2Describe how each of the core principles of cybersecurity can be threatened
  • 4.2.3Describe the aims and processes involved in cybersecurity threats, limited to: brute-force attack · data interception · distributed denial of service (DDoS) attack · hacking and unauthorised access · malware (virus, worm, Trojan horse, spyware, adware, ransomware) · pharming · phishing · social engineering · structured query language (SQL) injection
  • 4.2.4Explain how solutions are used to help keep data safe from cybersecurity threats, limited to: access levels · anti-malware, including anti-virus and anti-spyware · authentication (username and password, biometrics, two-step verification) · automating software updates · checking the spelling and tone of communications · checking the URL attached to a link · firewalls · privacy settings · proxy servers · transport layer security (TLS) · virtual private network (VPN)
  • 4.2.5Describe the purpose of encryption when storing or transmitting data, including: protecting confidentiality · ensuring integrity · supporting authenticity and non-repudiation
  • 4.2.6Explain how data is encrypted using symmetric and asymmetric encryption methods

Closest current topics: 2. Data Transmission, 5. The Internet and Its Uses

5. Software5.1 · 5.2

5.1 Types of software and interrupts

  • 5.1.1Describe the purpose of an operating system as the software layer that manages the system resources that provides a platform for running application software and an interface for users to interact with the computer hardware
  • 5.1.2Describe how an operating system manages user accounts and system security
  • 5.1.3Describe how an operating system manages files, including: file systems · directories
  • 5.1.4Describe how an operating system manages memory, including: allocating memory to processes · loading processes into RAM · paging and segmentation · virtual memory · memory protection
  • 5.1.5Describe how an operating system manages processes, including: scheduling processes · enabling inter-process communication
  • 5.1.6Describe how an operating system manages peripherals and device drivers
  • 5.1.7Describe how an operating system handles interrupts, including: the conditions that cause hardware and software interrupts · how an interrupt is handled with an interrupt service routine (ISR) · how the operating system ensures the interrupted process can later resume

5.2 Programming languages, translators and IDEs

  • 5.2.1Describe the features of: high-level languages · low-level languages, including assembly language · syntax
  • 5.2.2Explain the advantages and disadvantages of high-level and low-level languages
  • 5.2.3Describe the features and operation of: a compiler · an interpreter · an assembler
  • 5.2.4Explain the advantages and disadvantages of each translator and identify the most appropriate for use in a given scenario
  • 5.2.5Describe the purpose of an integrated development environment (IDE) as a tool to support software development with various functionality provided, including: code editors · run-time environment · translators · error diagnostics · auto-completion / code completion · prettyprint · AI assistance

Closest current topics: 4. Software

6. Automated systems and robotics6.1 · 6.2

6.1 Automated systems

  • 6.1.1Understand that a microcontroller is a complete computer system on a single chip, containing a processor, a small amount of RAM and ROM, and I/O ports
  • 6.1.2Understand that sensors are used to detect changes in the physical environment and an analog-to-digital converter (ADC) is used to convert analogue signals into digital data
  • 6.1.3Identify a suitable sensor for a given scenario
  • 6.1.4Describe the purpose and characteristics of an embedded system
  • 6.1.5Identify systems, devices and machines in which embedded systems are commonly used
  • 6.1.6Understand that actuators are devices that do actions in response to the output from a microcontroller
  • 6.1.7Describe how sensors, microcontrollers and actuators can be used in collaboration to create automated systems
  • 6.1.8Evaluate the advantages and disadvantages of using automated systems for: transport · agriculture · domestic settings · retail
  • 6.1.9Evaluate the implications automated systems have on: employment · safety · environmental sustainability

6.2 Robotics

  • 6.2.1Define robotics as a branch of technology that incorporates the design, construction, operation and use of robots
  • 6.2.2Describe the characteristics of a robot, including: a mechanical structure or framework · electronic components, such as sensors, microcontrollers and networking hardware, motors, actuators and power supplies · programmability
  • 6.2.3Describe the roles that robots can perform in the following areas: industry · agriculture · medicine
  • 6.2.4Evaluate the advantages and disadvantages of the use of robots in the areas listed in 6.2.3
  • 6.2.5Evaluate the implications of using robots for: employment · safety · environmental sustainability

Closest current topics: 6. Automated and Emerging Technologies, 3. Hardware

7. Emerging technologies7.1 · 7.2

7.1 Artificial Intelligence

  • 7.1.1Understand that artificial intelligence (AI) is a branch of computer science focused on the simulation of intelligent behaviours by computers
  • 7.1.2Describe the main features of AI, including: the collection of data · the rules for using that data · the ability to process large data sets · the ability to reason · the ability to learn and adapt using supervised learning, unsupervised learning and reinforcement learning
  • 7.1.3Describe common applications of AI, limited to: recommendation systems · natural language processing and large language models (LLMs) · generative AI, including, images and video · computer vision, including links to robotics and automated systems · predictive analytics
  • 7.1.4Understand the structure of neural networks as the: input layer · hidden layer(s) · output layer
  • 7.1.5Explain the purpose of machine learning including how neural networks are used
  • 7.1.6Identify different ways that AI can be used in a given context
  • 7.1.7Evaluate the fairness and bias in data and AI systems
  • 7.1.8Evaluate the ethical and societal considerations of AI
  • 7.1.9Evaluate the implications of AI for: employment · safety · environmental sustainability

7.2 Quantum computers

  • 7.2.1Describe the differences between a quantum computer and a classical computer using terms such as: bit · qubit · electrons / photons · binary · logic gates
  • 7.2.2State the advantages and disadvantages of using quantum computers instead of classical computers

Candidates will not be required to explain quantum theory related to the function of a quantum computer

Closest current topics: 6. Automated and Emerging Technologies

Paper 2 · Algorithms and Programming

8. Programming fundamentals8.1 · 8.2

8.1 Programming concepts

  • 8.1.1Understand the purpose of variables and constants and initialise them in Python
  • 8.1.2Identify and use the basic data types: (int) integer · (float) real · (str) string · (bool) Boolean
  • 8.1.3Use casting to convert between the data types in 8.1.2
  • 8.1.4Identify and use inputs and outputs
  • 8.1.5Demonstrate and use the following programming constructs: sequence · selection — if, elif and else statements; nested selection; match-case · iteration — for loop (count-controlled); while loop (pre-condition); while, break (post-condition loop); nested iteration (loops) · Understand and use the concepts of totalling and counting
  • 8.1.6Demonstrate and use the concept of string handling, including: len() length · .find() find the position of a substring · .count() count substrings · .upper() uppercase · .lower() lowercase · .title() title case · .replace() replace · + concatenation

The first character of the string is position zero

8.2 Programming operators

  • 8.2.1Demonstrate and use arithmetic operators, limited to: + (addition) · – (subtraction) · / (float division) · * (multiplication) · ** (raise to the power of) · % (modulus division) · // (floor division)
  • 8.2.2Demonstrate and use relational operators, limited to: == equal to · != not equal to · < less than · <= less than or equal to · > greater than · >= greater than or equal to
  • 8.2.3Demonstrate and use logical operators, limited to: and · or · not

Closest current topics: 8. Programming

9. Algorithm design9.1 · 9.2 · 9.3

9.1 Abstraction

  • 9.1.1Describe abstraction as the process of creating a simplified model that represents the essential features of a problem
  • 9.1.2Explain the purpose of abstraction for a given context
  • 9.1.3Demonstrate how to use abstraction

9.2 Decomposition

  • 9.2.1Describe decomposition as the process of breaking down problems into smaller, more manageable sub problems
  • 9.2.2Describe how a problem can be decomposed into its component parts, limited to: inputs · processes · outputs · storage
  • 9.2.3Explain the purpose of decomposition for a given context
  • 9.2.4Demonstrate how to use decomposition

9.3 Algorithm design and evaluation

  • 9.3.1Design, complete and amend algorithms for a given context using: a flowchart · Python code
  • 9.3.2Explain the purpose of a given algorithm and the purpose of the component parts, limited to: inputs · outputs · processes · storage
  • 9.3.3Complete a trace table for a given algorithm including inputs, outputs and variables for a given set of data
  • 9.3.4Identify and correct errors in a given algorithm
  • 9.3.5Amend an algorithm
  • 9.3.6Show how searching algorithms are performed on a given set of data, limited to: linear search · binary search
  • 9.3.7Show how sorting algorithms are performed on a given set of data, limited to: bubble sort · insertion sort · merge sort
  • 9.3.8Construct the algorithms using a flowchart or Python for a: linear search · bubble sort
  • 9.3.9Describe the steps involved in a: linear search · binary search · bubble sort · merge sort
  • 9.3.10Compare and contrast the features and efficiency of algorithms, limited to: linear search · binary search · bubble sort · merge sort

Candidates will not be expected to use Big-O notation when comparing algorithms

Flowcharts may contain multiple statements in one box

A decision box may combine a process and a decision

Closest current topics: 7. Algorithm Design and Problem-Solving

10. Further programming and testing10.1 · 10.2 · 10.3 · 10.4 · 10.5

10.1 Variables and constants

  • 10.1.1Demonstrate and use local and global variables
  • 10.1.2Demonstrate and use local and global constants
  • 10.1.3Explain the advantages and disadvantages of local and global: variables · constants

10.2 Procedures and functions

  • 10.2.1Identify procedures and functions in a given context
  • 10.2.2Explain the purpose and concept of procedures and functions in a given context
  • 10.2.3Demonstrate and use functions, including: sum() totalling · .count() counting · max() maximum · min() minimum · .mean() mean average · round() rounds a number · random.randrange() random number generation · random.randint() random number generation
  • 10.2.4Demonstrate and use procedures and call functions with or without parameters

10.3 Lists

  • 10.3.1Explain the purpose of a list including its features
  • 10.3.2Define, initialise and use one-dimensional (1D) and two-dimensional (2D) lists, including: a variable for the index · writing into, and reading from a list including the use of iteration · iterating through each element in a list
  • 10.3.3Use Python's built-in functions and operators for working with lists, including: sum() · max() · min() · len() · .append() · .insert() · .pop() · .sort() · in, not in (membership)
  • 10.3.4Write algorithms for a: linear search · bubble sort

The first index is zero

10.4 File handling

  • 10.4.1Explain the purpose of storing data in a file to be used by a program
  • 10.4.2Demonstrate and use: open() open a file · .close() close the file · with open() · "r" open in read mode · "w" open in write mode · "a" open in append mode · .read(), .readline(), .readlines() read the file · .write() write to file

10.5 Testing

  • 10.5.1Describe the purpose of validation checks, limited to a: range check · length check · type check · presence check · format check · check digit
  • 10.5.2Write Python code to validate input data for a given scenario, (inclusive and exclusive)
  • 10.5.3Explain the purpose of verification, including the function of visual and double entry checks
  • 10.5.4Write Python code to do a double entry check
  • 10.5.5Suggest and apply suitable normal, boundary and erroneous test data
  • 10.5.6Identify and debug errors in given Python code
  • 10.5.7Identify and explain the different types of programming errors, limited to: syntax error · logic/logical errors · run-time errors
  • 10.5.8Demonstrate and use techniques that make a program easier to maintain, including: meaningful identifiers · appropriate commenting · procedures and functions · relevant program layout

Closest current topics: 8. Programming, 7. Algorithm Design and Problem-Solving

11. Databases and Structured Query Language (SQL)11.1 · 11.2

11.1 Databases

  • 11.1.1Define a single-table database from given data storage requirements, including: fields · records · validations
  • 11.1.2Define a two-table relational database from given data storage requirements, including: fields · records · validations
  • 11.1.3Identify data types, limited to: text · character · Boolean · integer · decimal · date · time · currency
  • 11.1.4Explain the purpose of a primary key
  • 11.1.5Identify a suitable primary key for a given table
  • 11.1.6Explain the purpose of a foreign key to establish a link and join two tables
  • 11.1.7Identify a suitable foreign key for a given database
  • 11.1.8Demonstrate how two tables can be joined in a database

11.2 SQL

  • 11.2.1Write structured query language (SQL) statements using one or more conditions to retrieve data from a one and two table database
  • 11.2.2Correct SQL statements
  • 11.2.3Explain and demonstrate the result for a given SQL statement, limited to: SELECT, FROM, WHERE · INSERT INTO · ORDER BY DESCENDING · ORDER BY ASCENDING · SUM · COUNT · AND · OR · INNER JOIN, ON

Closest current topics: 9. Databases

Official documents

The syllabus also names Cambridge IGCSE Computer Science 0265 as a separate syllabus that cannot be taken in the same series as 2210 or 0478; this site does not cover 0265. Cambridge's pages

Transcribed from Cambridge O Level Computer Science 2210 / Cambridge IGCSE Computer Science 0478, syllabus for 2029, 2030 and 2031, Version 1 (published September 2026); checked against the PDF by scripts/check-syllabus-2029.ts. Syllabus content © Cambridge University Press & Assessment. All syllabus versions →

Enroll nowOnline classes