Learn how computers really work —
one vivid idea at a time.
A complete, visual-first course for Cambridge IGCSE 0478. Every lesson opens with one concrete picture, earns the formal detail, then puts it to work — with animations you can poke, checkpoints that ask before they tell, and quizzes that explain every answer.
- 34
- interactive lessons
- 73
- visualizations
- 8
- unit exams
- 100%
- 0478 syllabus
One concrete example does the explaining — the mental picture before any formula.
Then the definitions, notation and rules — the rigor, once you can see why it matters.
Finally a worked problem start to finish, plus practice that builds real exam skill.
Lessons
Released lessons are linked; the rest unlock as the course moves on.
- 01→
The Binary Number System
How computers count using only 0 and 1. Place value, conversions both ways, and why binary won.
IG·Topic 1.1 — Number systems·20 min - 02→
The Hexadecimal Number System
Why hex exists, how to convert between hex, binary, and denary.
IG·Topic 1.1 — Number systems·22 min - 03
Binary Addition & Logical Shifts
coming soonCarrying bits, shifts as multiplication and division by 2.
IG·Topic 1.1 — Number systems·22 min - 04
Two's Complement (Negative Binary Numbers)
coming soonHow computers represent negatives using one trick: give the leftmost bit a negative place value.
IG·Topic 1.1 — Number systems·24 min - 05
Text Representation — ASCII & Unicode
coming soonCharacters are numbers. Why ASCII was enough for English and Unicode was needed for the world.
IG·Topic 1.2 — Text representation·22 min - 06
Sound Representation
coming soonHow a continuous wave becomes a sequence of numbers: sampling, bit depth, and the quality vs. file-size trade-off.
IG·Topic 1.3 — Sound·22 min - 07
Image Representation
coming soonEvery digital image is a grid of coloured pixels. How resolution and colour depth control quality and size.
IG·Topic 1.4 — Images·22 min - 08
Data Storage & Compression
coming soonWhy files can shrink without losing information — and when losing a little information is the right bargain.
IG·Topic 1.5 — Compression·22 min - 09
Data Transmission Basics
coming soonSerial vs parallel, simplex/half-duplex/full-duplex. Why USB is serial full-duplex and why parallel cables lose the long-distance race.
IG·Topic 2.1 — Data transmission·22 min - 10
Error Detection
coming soonParity bits, parity blocks, checksums, echo check, and ARQ — how networks notice flipped bits and recover from lost messages.
IG·Topic 2.1 — Error detection·24 min - 11
USB and Packet Switching
coming soonWhy USB-C replaced a desk full of plugs, and how the internet delivers data using numbered packets that take independent paths.
IG·Topic 2.1 / 2.2 — USB & packets·24 min - 12
CPU Architecture and the Fetch–Decode–Execute Cycle
coming soonVon Neumann architecture and the fetch-decode-execute cycle. Step through a 3-instruction program and watch the registers and buses light up.
IG·Topic 3.1 — Architecture of the CPU·25 min - 13
CPU Performance and Embedded Systems
coming soonClock speed, cores, cache hierarchy — and why no single number ranks CPUs. Plus embedded systems: the chips inside microwaves, cars, and routers.
IG·Topic 3.1 — CPU performance + embedded systems·23 min - 14
Input and Output Devices
coming soonTouchscreens (resistive vs capacitive vs infrared), scanners, sensors, actuators — and how to pick the right combination for any scenario.
IG·Topic 3.2 — Input and output devices·24 min - 15
Storage and Memory
coming soonRAM vs ROM, HDD vs SSD vs optical, virtual memory, and cloud storage — the full memory hierarchy from boot to cloud.
IG·Topic 3.3 — Data storage·24 min - 16
Operating Systems and What They Do
coming soonWhat an OS is, the seven core functions, and how a single keystroke engages process management, hardware drivers, and the display compositor.
IG·Topic 4.1 — Operating systems·22 min - 17
System Software, Applications, and Interrupts
coming soonSystem vs application software, the utility programs that keep computers running, and the interrupt mechanism that makes the CPU instantly responsive.
IG·Topic 4.2 — Software types and interrupts·22 min - 18
Programming Languages and Translators
coming soonThree language levels (machine code → assembly → high-level) and the three translators (compiler, interpreter, assembler) that bridge them.
IG·Topic 4.3 — Languages and translators·24 min - New section
Section 2 — Algorithms, programming, and logic
Foundational skills tested on Paper 2. These can be taken alongside Topics 1–6.
- 19
Algorithms, Pseudocode, and Flowcharts
coming soonWhat an algorithm is, how to write Cambridge-style pseudocode, the five standard flowchart symbols, and how to trace a variable's value through a running algorithm.
IG·Section 2 — Algorithms intro·25 min - 20
Sorting Algorithms
coming soonBubble sort and insertion sort: animated walk-throughs, pass-by-pass trace tables, pseudocode for each, and the trade-offs that determine which to choose for a given input.
IG·Section 2 — Sorting·26 min - 21
Searching Algorithms
coming soonLinear search and binary search: pseudocode, animated walk-throughs on a sorted 16-element list, Cambridge-style binary search trace tables, and the dramatic speed difference at scale.
IG·Section 2 — Searching·22 min - 22
Boolean Logic and Truth Tables
coming soonThe six standard logic gates (AND, OR, NOT, NAND, NOR, XOR), Boolean expressions, and step-by-step truth table construction. Click-to-toggle gate playground with live truth-table highlighting.
IG·Section 2 — Logic gates and truth tables·24 min - 23
Programming Concepts
coming soonVariables, constants, the five Cambridge data types (INTEGER, REAL, CHAR, STRING, BOOLEAN), arithmetic operators including DIV/MOD, and comparison operators. Includes a games-shop till and a leap-year detector as worked examples.
IG·Section 2 — Variables, types, operators·24 min - 24
Arrays and Strings
coming soon1D and 2D arrays in Cambridge pseudocode: declaration, subscript access, FOR-loop traversal patterns (total, max, search). The six standard string operations (LENGTH, LEFT, RIGHT, SUBSTRING, LCASE, UCASE).
IG·Section 2 — Data structures, string operations·24 min - 25
Subroutines: Procedures and Functions
coming soonCambridge PROCEDURE and FUNCTION syntax, parameters, return values, the CALL keyword, and local vs global variable scope. Animated call-and-return visualiser plus a scope frame explorer.
IG·Section 2 — Subroutines, scope·24 min - 26
File Handling
coming soonCambridge file operations OPENFILE, READFILE, WRITEFILE, CLOSEFILE, and the EOF function. The three modes (READ, WRITE, APPEND) with their critical behaviour differences. Includes the canonical 'WHILE NOT EOF' loop pattern.
IG·Section 2 — File handling, persistence·24 min - 27
Validation and Verification
coming soonThe five Cambridge validation types (presence, range, length, format, type) and the two verification methods (double entry, visual check). Live form validator and double-entry simulator.
IG·Section 2 — Validation, verification·22 min - 28
Databases and SQL
coming soonDatabase vocabulary (table, record, field, primary key), Cambridge data types, and the four core SQL clauses (SELECT, FROM, WHERE, ORDER BY) plus INSERT/UPDATE/DELETE. Includes an interactive query runner and a schema inspector.
IG·Section 2 — Databases, single-table SQL·24 min - 29
HTML, CSS, and JavaScript
coming soonThe three-layer web-page model: HTML for structure, CSS for presentation, JavaScript for behaviour. Common HTML tags, the role of each language, and why separation matters. Interactive layer toggle + concern-to-language explorer.
IG·Topic 5 — HTML structure, CSS, JavaScript roles·22 min - 30
HTTP, HTTPS, and Web Browsers
coming soonHTTP vs HTTPS (the encryption and identity-verification differences), URL anatomy (protocol, domain, path), browser functions, and the role of digital certificates and Certificate Authorities. Includes a URL anatomy explorer and an animated request-response visualiser.
IG·Topic 5 — HTTP/HTTPS, browsers, certificates·24 min - 31
Cookies and Digital Currency
coming soonCookies as the web's memory: session vs persistent, common uses, privacy concerns, mitigations. Digital currency vs traditional money. Blockchain at IGCSE depth — chain structure, distribution, and tamper-evidence. Includes an interactive cookie-jar simulator and a 5-block blockchain explorer with tamper button.
IG·Topic 5 — Cookies, digital currency, blockchain·22 min - 32
Cyber Security
coming soonEight Cambridge-listed threats (brute-force, data interception, DDoS, hacking, malware with 6 subtypes, phishing, pharming, social engineering) and 11 defences. Phishing vs pharming distinction. Includes a threat gallery and a many-to-many threat-defence matcher.
IG·Topic 5 — Cyber security threats and prevention·26 min - 33
Automated Systems
coming soonThe sensor → microprocessor → actuator pattern: sense, decide, act. Common sensors and actuators. Cambridge-listed applications (greenhouse, alarm, traffic lights, automatic doors, washing machine, production line). Advantages and disadvantages. Includes an interactive system tracer with sensor slider and an application-sensor-actuator matcher.
IG·Topic 6 — Sensors, microprocessors, actuators·22 min - 34
Artificial Intelligence
coming soonAI as software that LEARNS from data. 8 common applications (chatbots, recommendation, image/voice recognition, autonomous vehicles, machine translation, fraud detection, game AI). Narrow vs general AI distinction. Training-data pipeline with bias toggle. Advantages and disadvantages with ethical concerns. Spaced-review covers L29 (HTML/JS) and L33 (sensors).
IG·Topic 6 — AI: definition, applications, training data·22 min
Paper 2 scenario practice
Cambridge IGCSE 0478 Paper 2 ends with a 15-mark scenario question where you write a complete program from a written brief. These problems train that skill specifically — each includes a Cambridge-style scenario, a marking-scheme breakdown, three progressive hints, a pseudocode workspace with a structural sanity checker, and worked solutions in both pseudocode and Python.
Browse Paper 2 problems →Unit exams — checkpoint papers every few lessons
Shorter than the cumulative mocks below, each unit exam tests one block of lessons soon after you finish it — while the material is fresh enough to fix.
Number Systems & Binary Arithmetic
Take this after finishing Lesson 4. Binary, hex, addition & shifts, two's complement. 37 marks · 8 questions · ~60 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonRepresenting Media & Compression
Take this after finishing Lesson 8. Text, sound, images, storage & compression. 32 marks · 7 questions · ~60 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonData Transmission
Take this after finishing Lesson 11. Serial/parallel, error detection, packets & USB. 30 marks · 7 questions · ~55 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonHardware & System Software
Take this after Lesson 17. CPU, performance, devices, memory, OS, interrupts. 34 marks · 7 questions · ~70 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonLanguages, Algorithms & Logic
Take this after Lesson 22. Translators, pseudocode, sorting, searching, logic. 30 marks · 6 questions · ~70 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonProgramming
Take this after Lesson 27. Types, arrays, subroutines, files, validation. 29 marks · 6 questions · ~70 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonDatabases & The Web
Take this after Lesson 31. SQL, web languages, HTTPS, cookies & currency. 26 marks · 5 questions · ~65 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonSecurity, Automation & AI
Take this after Lesson 34. Threats & defences, control loops, expert systems & ML. 22 marks · 4 questions · ~55 minutes. Includes a cross-lesson synthesis question and a review-planning retrospective.
coming soonTopics 1–6 final cumulative paper
The full-syllabus mock paper covering all 34 lessons across all 6 Cambridge topics — from binary numbers through to artificial intelligence. 80 marks · 10 questions · ~100 minutes. The most comprehensive paper in the series; the closest practice to the real Cambridge IGCSE 0478 exam.
Start Topics 1–6 final paper →Topics 1–4 cumulative paper
Covers data representation, transmission, hardware, and software (lessons 1–18). 75 marks · 9 questions · ~90 minutes. Useful as a checkpoint after finishing Topic 4, before moving on to Section 2.
Start Topics 1–4 paper →Topics 1–3 cumulative paper
Covers Topics 1–3 only (lessons 1–15). 71 marks · 8 questions · ~90 minutes. Useful if you have completed Topics 1–3 but not yet started Topic 4.
Start Topics 1–3 paper →