Skip to content
cookie
Shared flashcard decks

Cambridge IGCSE Computer Science

IGCSE · Cambridge International (CAIE)Computer Science841 cards

More for Cambridge International (CAIE) IGCSE Computer Science

Picked for the same course from what people use most, and all of it can be read without an account.

Everything for Computer Science

Looking for help with Computer Science?

Cookie Tutoring, our own tutoring service, may have tutors for Computer Science. Lessons are live and one to one, and the first 15 minutes with any tutor is free.

Find a tutor

Flashcards for Cambridge IGCSE Computer Science (0478), split into Paper 1 Computer systems and Paper 2 Algorithms, programming and logic and then by topic in the syllabus's own numbered order, following the syllabus for examination in 2026, 2027 and 2028. Pseudocode, SQL and logic questions use Cambridge's own conventions, so the keywords match what is printed in the exam.

Adding it gives you your own copy, with every subdeck below. Each card then comes back just before you would forget it, and every one you get right or wrong counts towards your mastery of its topic. You can delete or suspend the parts you are not studying once it is yours.

What is inside (45 subdecks)

  • Paper 1 Computer systems519 cards
    • 1 Data representation113 cards
      • 1.1 Number systems50 cards
      • 1.2 Text, sound and images25 cards
      • 1.3 Data storage and compression38 cards
    • 2 Data transmission64 cards
      • 2.1 Types and methods of data transmission32 cards
      • 2.2 Methods of error detection22 cards
      • 2.3 Encryption10 cards
    • 3 Hardware156 cards
      • 3.1 Computer architecture50 cards
      • 3.2 Input and output devices54 cards
      • 3.3 Data storage33 cards
      • 3.4 Network hardware19 cards
    • 4 Software58 cards
      • 4.1 Types of software and interrupts28 cards
      • 4.2 Programming languages, translators and IDEs30 cards
    • 5 The internet and its uses91 cards
      • 5.1 The internet and the world wide web32 cards
      • 5.2 Digital currency8 cards
      • 5.3 Cyber security51 cards
    • 6 Automated and emerging technologies37 cards
      • 6.1 Automated systems9 cards
      • 6.2 Robotics12 cards
      • 6.3 Artificial intelligence16 cards
  • Paper 2 Algorithms, programming and logic322 cards
    • 7 Algorithm design and problem-solving82 cards
      • 7.1 Program development and design23 cards
      • 7.2 Standard methods of solution16 cards
      • 7.3 Validation, verification and test data36 cards
      • 7.4 Trace tables and algorithm errors7 cards
    • 8 Programming159 cards
      • 8.1 Programming concepts132 cards
        • 8.1.1 Variables, constants and data types24 cards
        • 8.1.2 Input, output and sequence7 cards
        • 8.1.3 Selection13 cards
        • 8.1.4 Iteration23 cards
        • 8.1.5 Totalling, counting and string handling12 cards
        • 8.1.6 Operators21 cards
        • 8.1.7 Procedures, functions and parameters22 cards
        • 8.1.8 Library routines and maintainable programs10 cards
      • 8.2 Arrays15 cards
      • 8.3 File handling12 cards
    • 9 Databases36 cards
    • 10 Boolean logic45 cards

Some of its cards

  • Primary storage
    Memory that is directly accessed by the CPU
  • Count-controlled loop
    A loop that repeats a set number of times, using a variable that counts up or down between two values
  • How does a linear search work?
    It checks each item in a list in turn, starting from the first, until it finds the target or reaches the end of the list
  • What does the pseudocode function `ROUND` do?
    Rounds a value to a given number of decimal places
  • A single category of data stored in a database table, shown as a column
    Field
  • A logic gate with one input that outputs the opposite of its input
    NOT gate
  • A single binary digit, 0 or 1: the smallest unit of data a computer stores
    Bit
  • Why must data be checked for errors after it has been transmitted?
    Interference during transmission can cause data to be lost, gained or changed
  • What does a trace table record as an algorithm is followed step by step?
    The value of each variable, plus any output and user prompts, at each step
  • A named block of code that carries out a task and is called using `CALL`, but does not return a value
    Procedure

And 831 more once you add the deck.