Cambridge IGCSE Computer Science (0478) Flashcards

266 free flashcards covering every syllabus topic of Cambridge IGCSE Computer Science (0478) — 165 key definitions, and 77 core concepts across 28 topics. Each card uses a built-in spaced-repetition algorithm to schedule your reviews automatically.

Syllabus-aligned Free, no signup Spaced repetition built-in

Why flashcards work for IGCSE Computer Science

Cambridge IGCSE Computer Science 0478 is vocabulary-dense: hexadecimal vs binary, validation vs verification, bandwidth vs latency, RAM vs ROM, interrupt vs polling.

Paper 1 multiple choice and Paper 2 structured questions both hinge on choosing the right technical word in the right context. Flashcards build the discrimination between near-synonym pairs that examiners deliberately test.

Top mark-loser this 0478 deck targets: mixing up "validation" (data is sensible) with "verification" (data is unchanged) — both appear in nearly every paper.

How spaced repetition keeps this deck out of your blind spots

Every card uses an SM-2 spaced-repetition schedule (the same algorithm Anki uses). After flipping a card you rate your recall — and the algorithm reschedules each card individually, so your study time concentrates on what you actually struggle with rather than what you already know. After about three successful Easy reviews and a 21-day-or-longer interval, a card is tagged mastered. Progress lives in your browser only — no account, no signup, no data sent anywhere.

Hard · resets the streak, returns tomorrow
Okay · returns in 1-3 days
Easy · pushed to next interval
165
Definitions
77
Key Concepts
28
Topics

Unit 1: Data representation

Binary, denary, and hexadecimal number systems and the conversions between them, ASCII vs Unicode character sets, sound and image representation, and file compression (lossy vs lossless). Hex-to-binary conversion is a Paper 1 multiple-choice staple — every four binary bits map to one hex digit. Bit-depth × sample-rate calculations for sound files appear in every recent paper; missing the bytes-vs-bits unit conversion is a common 1-mark loser.

Unit 2: Data transmission

Serial vs parallel, simplex / half-duplex / duplex, error detection methods (parity, checksum, ARQ), and symmetric vs asymmetric encryption. Parity-bit questions need a precise method — count the 1s, set the parity bit so the total is even (or odd). Asymmetric encryption hinges on the public-private key concept; candidates who confuse which key encrypts and which decrypts lose 2-4 marks per question.

Unit 3: Hardware

Von Neumann architecture, the fetch-decode-execute cycle, CPU components (ALU, CU, registers, cache), RAM vs ROM, secondary storage types, input/output devices, and logic gates. The fetch-execute cycle is a perennial 6-mark Paper 1 question — examiners want all stages (fetch instruction from RAM, store in MDR/IR, decode in CU, execute in ALU, increment PC). Logic-gate truth-table questions reward precise output columns; one wrong row typically loses 2 marks.

Unit 4: Software

System vs application software, the role of operating systems (file management, hardware management, user interface, security, memory management), high-level vs low-level languages, and translators (assembler, compiler, interpreter). Compiler vs interpreter comparison is a textbook 6-mark question; examiners want at least three paired differences (compile-once vs translate-each-run, faster execution vs slower, harder to debug vs easier).

Unit 5: The Internet and its uses

Networks (LAN vs WAN, topologies), the Internet vs the World Wide Web, packet switching, and security mechanisms (HTTPS, firewalls, proxy servers, SSL/TLS, digital certificates). HTTPS vs HTTP is marked precisely — examiners want "uses SSL/TLS encryption" and "data encrypted in transit" rather than vague "more secure". Phishing vs pharming vs hacking comparison is a recurring multi-mark question.

Unit 6: Automated and emerging technologies

Sensors (light, pressure, temperature, infrared, motion), microprocessors in embedded systems, robotics, and artificial intelligence including machine learning and expert systems. Examiners want sensors paired with concrete applications (infrared sensor in an automatic door, pressure sensor in a burglar alarm). AI vs robotics distinction is a frequent 2-mark trap — robotics is physical, AI is computational.

Unit 7: Algorithm design and problem-solving

Pseudocode conventions, flowcharts, trace tables, validation vs verification, and standard algorithms (linear search, binary search, bubble sort). Trace-table questions need every variable column filled at every iteration — leaving cells blank usually loses marks even if the final answer is right. Validation (data sensible) vs verification (data accurate) is heavily tested and confused by most candidates.

Unit 8: Programming

Variables, constants, data types (integer, real, string, char, boolean), sequence, selection, iteration (FOR / WHILE / REPEAT), sub-routines (functions vs procedures), arrays (1D and 2D), and basic file handling. Pseudocode questions need the syllabus conventions — DECLARE, INPUT, OUTPUT, FOR..NEXT, IF..THEN..ELSE..ENDIF — and arbitrary language style is penalised. Off-by-one errors in array indexing are the single most common 1-mark loser.

Unit 9: Databases

Database concepts (DBMS, fields, records, primary key, foreign key), single-table and relational databases, and SQL queries built from SELECT, FROM, WHERE, and ORDER BY plus the aggregate functions SUM, COUNT, MIN, MAX, AVG. SQL questions need exact syntax — SELECT * FROM Students WHERE Grade = 'A' — and incorrect quote style around strings or missing semicolons lose marks. Primary vs foreign key roles trip up most candidates and are a 2-mark perennial.

Unit 10: Boolean logic

Boolean operators (AND, OR, NOT, XOR, NAND, NOR), truth tables, and logic-circuit diagrams. Drawing a logic-circuit diagram from a Boolean expression is a heavy-marker question — wires must connect correctly, gate symbols must be standard, and inputs must be labelled. Truth-table questions are pure marks: list every input combination in binary count order and compute the output for each.

Pair flashcards with notes and papers

Flashcards are a recall tool, not a complete study system. Use them alongside these free resources for IGCSE 0478.

IGCSE Computer Science flashcards — FAQ

How many IGCSE Computer Science flashcards are on LumiExams?
266 flashcards in total, organised across 28 syllabus topics for Cambridge IGCSE Computer Science (0478). The breakdown: 165 key definitions, and 77 core concepts.
In what order should I study these 0478 flashcards?
If you are starting from scratch, study in syllabus order — Unit 1 first, then Unit 2, and so on. The topics on this page are grouped by unit for that purpose. If you are revising for a specific paper close to the exam, jump to the units that contribute most marks on that paper and use the per-topic decks instead. For deeper context on any topic, the revision notes hub for 0478 is linked above.
What does it mean when a card is "mastered"?
A card moves through four states: NewLearningReviewMastered. It reaches Mastered after at least 3 successful Easy reviews and when the next-review interval reaches 21 days or more. A Hard rating resets a card's repetitions to zero — so consistency matters. Progress is stored locally in your browser; clearing browser data resets it.
Are flashcards enough on their own to pass IGCSE Computer Science?
No — flashcards are a recall tool, not a complete study system. They reinforce definitions and high-yield facts, but they cannot teach you to apply concepts to long-form exam questions or to handle the data-response and 6-mark "explain" questions. Pair them with the free 0478 revision notes on this site, past papers under timed conditions, and the official Cambridge syllabus PDF.
How are these different from Quizlet or Anki Computer Science decks?
These flashcards are built specifically against the Cambridge IGCSE Computer Science 0478 syllabus topic codes, with content reviewed against the official mark scheme wording. Generic Quizlet decks vary wildly in quality and rarely tag content to a specific exam board's syllabus. LumiExams cards are also free with no signup, store progress locally on your device only, and use a real SM-2 spaced-repetition algorithm rather than the random-shuffle most Quizlet decks default to.
How long should I spend per flashcard?
About 10-15 seconds for definitions and 20-30 seconds for concepts is typical. If you find yourself thinking longer than 30 seconds, rate the card Hard so it returns tomorrow — don't try to reason your way through every recall. The point of spaced repetition is to surface gaps quickly and repeat them, not to grind on a single card.

Other Cambridge IGCSE flashcard decks

Browse flashcards for the other IGCSE subjects we cover. Each deck is built to the same Cambridge syllabus structure.