Cambridge (CIE) · IGCSE

Computer Science 0265

Understand how computers represent and process information, then develop algorithms, programming skills and logical reasoning.

33 lessons and reviews0 practice setsSyllabus 2029

Start learning Browse sections

At a glance

What you'll cover

Computer Systems and Logic
Algorithms and Programming

Explore the sections

Published syllabus exam years: 2029. Confirm exam-series and centre availability with your school and Cambridge.

Syllabus 2029

Cambridge IGCSE Computer Science 0265 syllabus map

2029 syllabus · Version 1

11 of 11 sections have teaching and practice

Start the learning pathway

Study options and assessment

All 11 syllabus topics link to 33 original lessons. Each lesson includes worked teaching, a check with explanation and guided, independent and application practice. This is mapped teaching, not evidence of exam readiness, teacher approval or a Cambridge grade. Cambridge specifies two externally assessed digital exams; StudyForA does not yet provide full timed digital-paper simulations or an executable Python 3.10+ workspace for practical programming. The currently published syllabus is for 2029; later-year coverage is not claimed.

Cambridge's qualification page describes a 2029–2031 syllabus, while its currently linked PDF says to use that document for exams in 2029. This route currently supports the published 2029 PDF only; coverage for exams in 2030 and 2031 remains unverified until Cambridge publishes or confirms the applicable documents. Cambridge lists June and November series.

Choose your paper route

Component 1 – Computer Systems and LogicDigital exam · 1 hour 45 minutes · 75 marks · 50% · no calculator
Short-answer and structured questions from Topics 1–7. All questions are compulsory and externally assessed.
Component 2 – Algorithms and ProgrammingDigital exam · 1 hour 45 minutes · 75 marks · 50% · calculator permitted
Short-answer and structured questions from Topics 8–11, including a 15-mark unseen Python 3.10+ scenario. All questions are compulsory and externally assessed.

View syllabus coverage

The course maps all 11 subject topics to original teaching and three forms of self-check practice. Each component lasts 1 hour 45 minutes and is worth 75 marks (50%). Component 1 does not permit calculators; Component 2 permits calculators and includes a 15-mark unseen Python 3.10+ scenario. Both are digital exams. Cambridge's assessment overview assigns Topics 1–7 to Component 1, while the detailed assessment section says Topics 1–8; Topic 8 is therefore included in both component review links here and the syllabus wording should be confirmed against Cambridge's final guidance. StudyForA practice is not official Cambridge assessment. A runnable Python workspace, accessible digital exam interface and timed full-paper simulation still need building and testing; human subject-specialist review is also outstanding.

Computer Systems and Logic

Data representation and logic gates1
Number systems and logic gates Binary arithmetic, shifts and two’s complement Storage units, text, sound and images Lossy and lossless compression
Logic circuits and hardware2
Logic circuits and truth tables CPU architecture and the fetch–decode–execute cycle Primary, secondary and virtual memory
Data transmission and networking3
Packet switching and transmission methods Network hardware, MAC and IP addresses The web, DNS, cookies and cloud services
Data integrity and cybersecurity4
Data integrity and error checking Cybersecurity principles and threats Cybersecurity controls and encryption
Software5
Operating systems, processes and interrupts Programming languages, translators and IDEs
Automated systems and robotics6
Automated systems, sensors and actuators Robotics, automation and their impacts
Emerging technologies7
AI, machine learning and neural networks Quantum and classical computers

Algorithms and Programming

Programming fundamentals8
Python variables, data types and control Python strings and operators
Algorithm design9
Abstraction and decomposition Algorithm design, tracing and debugging Searching and sorting algorithms Insertion sort and merge sort
Further programming and testing10
Python scope, functions and procedures Python lists, tables and list algorithms Python file handling Validation, verification and program testing Double-entry verification and test design
Databases and Structured Query Language (SQL)11
Database design, keys and relationships SQL queries, conditions and joins SQL inserts, ordering and conditions

Practice the papers

Assessment skills

Practice the papers

Computer Systems and LogicComponent 1 · 21 lessons
Number systems and logic gates Binary arithmetic, shifts and two’s complement Storage units, text, sound and images Lossy and lossless compression Logic circuits and truth tables CPU architecture and the fetch–decode–execute cycle Primary, secondary and virtual memory Packet switching and transmission methods Network hardware, MAC and IP addresses The web, DNS, cookies and cloud services Data integrity and error checking Cybersecurity principles and threats Cybersecurity controls and encryption Operating systems, processes and interrupts Programming languages, translators and IDEs Automated systems, sensors and actuators Robotics, automation and their impacts AI, machine learning and neural networks Quantum and classical computers Python variables, data types and control Python strings and operators
Topic-linked review for the non-calculator digital component. The syllabus overview and detailed assessment section differ on whether Topic 8 is included; this review follows the detailed section. These lessons are not a timed or Cambridge-marked paper.
Algorithms and ProgrammingComponent 2 · 14 lessons
Python variables, data types and control Python strings and operators Abstraction and decomposition Algorithm design, tracing and debugging Searching and sorting algorithms Insertion sort and merge sort Python scope, functions and procedures Python lists, tables and list algorithms Python file handling Validation, verification and program testing Double-entry verification and test design Database design, keys and relationships SQL queries, conditions and joins SQL inserts, ordering and conditions
Topic-linked review for the calculator-permitted digital component. Python practice is currently written and self-checked; there is no live code runner or full 15-mark scenario simulator yet.

Learn

Lessons and worked examples

Your topic map

Choose where to begin

All subject practice

Choose a lesson, try the practice and explain the idea without your notes. Your study checks help you decide what to review.

01
Number systems and logic gates
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
02
Binary arithmetic, shifts and two’s complement
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
03
Storage units, text, sound and images
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
04
Lossy and lossless compression
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
05
Logic circuits and truth tables
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
06
CPU architecture and the fetch–decode–execute cycle
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
07
Primary, secondary and virtual memory
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
08
Packet switching and transmission methods
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
09
Network hardware, MAC and IP addresses
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
10
The web, DNS, cookies and cloud services
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
11
Data integrity and error checking
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
12
Cybersecurity principles and threats
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
13
Cybersecurity controls and encryption
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
14
Operating systems, processes and interrupts
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
15
Programming languages, translators and IDEs
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
16
Automated systems, sensors and actuators
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
17
Robotics, automation and their impacts
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
18
AI, machine learning and neural networks
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
19
Quantum and classical computers
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
20
Python variables, data types and control
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
21
Python strings and operators
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
22
Abstraction and decomposition
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
23
Algorithm design, tracing and debugging
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
24
Searching and sorting algorithms
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
25
Insertion sort and merge sort
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
26
Python scope, functions and procedures
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
27
Python lists, tables and list algorithms
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
28
Python file handling
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
29
Validation, verification and program testing
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
30
Double-entry verification and test design
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
31
Database design, keys and relationships
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
32
SQL queries, conditions and joins
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review
33
SQL inserts, ordering and conditions
Learn the method · Practise with help · Try it yourself · Apply the idea
Not started
Learn Review

These checks record your study activity and self-assessment, not a mastery score. Check the course coverage map for available lessons and remaining topics.

Apply

Practise this subject

Topic tests: Easy, Normal and Difficult

Choose a topic, save your answers and compare your reasoning with worked models. See available tests and any coverage gaps.

Browse 11 topics →

No StudyForA practice set is published for this exact qualification yet. Use the official papers below or in the resource guide.

Cambridge IGCSE Computer Science 0265 syllabus map

Choose your paper route

Computer Systems and Logic

Algorithms and Programming

Practice the papers

Lessons and worked examples

Practise this subject

Topic tests: Easy, Normal and Difficult

Find your next subject

Computer Science on other exam boards

Related subjects on Cambridge