Computer Science Interactive Lab

Don't just learn it.
Experience it.

A fully interactive Cambridge Computer Science course. Every topic runs as a working system you operate yourself — then a marking-scheme walkthrough turns what you just did into exam marks.

CAIE 2210 · O Level CAIE 0478 · IGCSE CAIE 9618 · AS & A Level
Live from Chapter 2 · Data Transmission
Sender Packet Channel Receiver
Symmetric key cipher — key 4291362856
C
O
M
P
U
T
E
R
ciphertext so far GQVQ····
10chapters
100topics
97interactive simulations
439glossary terms
107practice activities
Jump straight in — no sign-up

Two tools you can open right now

Skip the tour. Write real Cambridge pseudocode or build a real exam-style flowchart in your browser this second.

Pseudocode Lab →

Write, run and trace real Cambridge pseudocode

A genuine interpreter, not a canned demo. Step through DECLARE, IF, FOR, arrays, procedures and functions, and watch a real trace table build line by line as your program runs.

FOR Index ← 1 TO 5    OUTPUT Index NEXT Index
Open the Pseudocode Lab →
Flowchart Studio →

Build, trace and export exam-style flowcharts

Drag on the real Cambridge symbols, link them up, then run a trace table alongside your own diagram to check it actually does what you drew.

⬭ Start→ ▭ Input N→ ◇ N > 0?→ ⬭ End
Open Flowchart Studio →
How every topic is built

Concept → Application → Exam Technique → Marks

The same four-stage sequence, every single topic — so the syllabus point you just watched work is the same one you'll be marked on.

Learn

The concept, in Cambridge's own words

Every topic opens with the exact syllabus definition and terminology — not a simplified paraphrase you'll have to unlearn in the exam.

Interact

Operate the system yourself

Step an ARQ exchange through a NACK and a retry. Watch two computers converge on a Diffie–Hellman key. Nothing is a diagram you only read.

Examine

Turning this into marks

A weak answer and a strong answer, side by side, for the same question — so you can see exactly what separates a vague sentence from full marks.

Practise

Prove it under exam conditions

Topic checks, past-paper-style activities and a chapter test close every chapter, with progress tracked so gaps don't survive to results day.

Paper 1 · Computer Systems

Six chapters, built topic by topic

Covers the shared core of 2210, 0478 and 9618 — the chapter list below is the exact structure of the course.

019 topics

Data representation

Number systems, binary arithmetic and two's complement, text/sound/images, and data storage and compression.

0210 topics

Data transmission

Packets and packet switching, transmission methods, error detection and correction, and encryption.

0320 topics

Hardware

Computer architecture, input and output devices, data storage, and network hardware.

0410 topics

Software

System and application software, the hardware/firmware/OS stack, utility software, interrupts, translators and IDEs.

0510 topics

The Internet and Its Uses

URLs, HTTP/HTTPS, browsers, DNS, cookies, digital currency and blockchain, cyber security threats and defences.

0610 topics

Automated and emerging technologies

Automated systems, robotics and artificial intelligence.

Paper 2 · Problem Solving

Four more chapters, same structure

Algorithms, programming, databases and logic — the problem-solving half of 2210 and 0478, built exactly like Paper 1.

079 topics

Algorithm design and problem-solving

The program development life cycle, structured diagrams, flowcharts, Cambridge pseudocode, validation, testing and trace tables.

089 topics

Programming

Variables and data types, sequence/selection/iteration, procedures and functions, maintainable code, arrays and file handling.

095 topics

Databases

Single-table databases, the six database data types, primary keys, and a real, live SQL query playground.

108 topics

Boolean logic

The six logic gates, reading and building circuits, truth tables and logic expressions, with live circuit widgets.

One simulation from every chapter

A sample of the 97 you can run

Picked one per chapter — the other 91 cover everything else on the syllabus, from logic gates to phishing emails.

01

Negate a positive number, step by step

Two's complement, worked bit by bit instead of stated as a rule.

02

Simulate an ARQ exchange

Force a NACK, watch the retry, hit the retry limit and see the transmission abandoned.

03

Trap or release the electrons

How a flash memory cell actually stores a 1 or a 0 — not just that it "has no moving parts."

04

Trigger an interrupt and watch the stack

See the processor's register state get pushed and popped around an ISR.

05

Tamper with a block and watch the chain break

Edit one blockchain block and watch every hash after it stop matching.

06

Run the inference engine

Feed facts and rules into an expert system and watch it reach a conclusion.

Built for the paper, not just the topic

Exam technique is a feature, not an afterthought

Weak

"Encryption keeps your data safe by locking it with a key."

Strong

"Symmetric encryption uses one shared key for both directions — fast, but that key must reach both parties and can be intercepted. Asymmetric encryption uses a linked public/private pair: anyone can encrypt with the public key, but only the private key — which never leaves its owner's device — can decrypt, which is what solves the key-distribution problem."

Ready when you are

Stop reading about packets. Send one.

Ten chapters, a hundred topics, every one a working system you operate yourself — open the lab and start on whichever one your next lesson needs.