IGCSE 0478CS THEORYPAPER 1 & 2

Student Notes

Clear, structured notes for every chapter — perfect for revision and quick reference. Pick a chapter below, choose a topic, and jump straight into the content.

IGCSE Paper Breakdown

CAMBRIDGE 0478 · SYLLABUS
Paper 1

Computer Systems

Theory — written exam on theory topics

Data RepresentationData TransmissionHardwareSoftwareThe Internet and Its UsesAutomated and Emerging Technologies
Paper 2

Algorithms, Programming & Logic

Practical focus — problem solving and coding

Algorithm designProgrammingDatabasesBoolean logic

All chapters and topics — 32 topics across 10 chapters

CHAPTER 1

Data Representation

3 Topics
1.1

Number Systems

Convert confidently between binary, denary and hexadecimal; understand binary addition, overflow and logical shifts.

OPEN NOTESExplore
1.2

Text, Sound, and Images

How characters, sound and pictures are represented: character sets, sample rates, resolutions, bit depths, and file compression basics.

OPEN NOTESExplore
1.3

Data Storage and Compression

Calculate storage needs for text, images and sound; storage units like KiB, MiB, GiB, TiB; lossy vs lossless compression methods.

OPEN NOTESExplore
CHAPTER 2

Data Transmission

3 Topics
2.1

Types and Methods of Data Transmission

Data packets and packet switching; serial & parallel, simplex, half-duplex and full-duplex; the USB interface.

OPEN NOTESExplore
2.2

Methods of Error Detection

Parity checks (even/odd), checksums, check digits, and ARQ — how errors are detected in transmitted data.

OPEN NOTESExplore
2.3

Encryption

Symmetric and asymmetric encryption techniques, and the differences between them.

OPEN NOTESExplore
CHAPTER 3

Hardware

4 Topics
3.1

Computer Architecture

The Fetch–Decode–Execute cycle, CPU components and registers, and the Von Neumann architecture.

OPEN NOTESExplore
3.2

Input and Output Devices

Scanners, microphones, screens, speakers, printers — how input and output devices are used and connect.

OPEN NOTESExplore
3.3

Data Storage

Physical, magnetic and optical storage; RAM and ROM; how storage media are used and their characteristics.

OPEN NOTESExplore
3.4

Network Hardware

Routers, network interface cards (NICs), and MAC and IP addresses — how data gets routed.

OPEN NOTESExplore
CHAPTER 4

Software

2 Topics
4.1

Types of Software and Interrupts

Operating systems and application software, and how interrupts are handled by the OS.

OPEN NOTESExplore
4.2

Types of Programming Language, Translators, and IDEs

High-level vs low-level languages; assemblers, compilers and interpreters; features of the IDE.

OPEN NOTESExplore
CHAPTER 5

The Internet and Its Uses

3 Topics
5.1

The Internet and the World Wide Web

The hardware and software behind the internet; browsers, web servers, HTTP/HTTPS and URLs.

OPEN NOTESExplore
5.2

Digital Currency

How digital currency payments work, and the advantages and disadvantages of online currency.

OPEN NOTESExplore
5.3

Cyber Security

Phishing, pharming and other security threats; prevention with biometrics, two-factor authentication and more.

OPEN NOTESExplore
CHAPTER 6

Automated and Emerging Technologies

3 Topics
6.1

Automated Systems

Sensors, microprocessors and actuators working together in automated feedback loops.

OPEN NOTESExplore
6.2

Robotics

Characteristics, components and roles of robots in industry and everyday life.

OPEN NOTESExplore
6.3

Artificial Intelligence

AI characteristics, machine learning, and expert systems — how intelligent systems are built and used.

OPEN NOTESExplore
CHAPTER 7

Algorithm Design and Problem Solving

9 Topics
7.1

The Program Development Life Cycle

Analyse, design, code and test — the phases of the program development life cycle.

OPEN NOTESExplore
7.2

Computer Systems, Sub-systems, and Decomposition

How systems are broken into sub-systems and decomposed for structured problem solving.

OPEN NOTESExplore
7.3

Explaining the Purpose of an Algorithm

Reading and interpreting given algorithms and expressing their purpose in plain words.

OPEN NOTESExplore
7.4

Standard Methods of Solution

Linear search, bubble sort, totals, counting, maxima and minima — the classic solution routines.

OPEN NOTESExplore
7.5

Validation and Verification

Data validation types (range, length, type, presence, format) and verification methods.

OPEN NOTESExplore
7.6

Test Data

Normal, abnormal, extreme and boundary test cases and why each matters.

OPEN NOTESExplore
7.7

Trace Tables and Dry Runs

Trace tables and dry runs to track variable changes and follow algorithm logic step by step.

OPEN NOTESExplore
7.8

Identifying Errors in Algorithms

Spotting syntax errors, logic errors, and correcting them in written algorithms.

OPEN NOTESExplore
7.9

Writing and Amending Algorithms

Matching algorithms to given problems, writing pseudocode and amending existing solutions.

OPEN NOTESExplore
CHAPTER 8

Programming

3 Topics
8.1

Programming Concepts

Variables, constants, data types, sequences, selection and iteration — the building blocks of programs.

OPEN NOTESExplore
8.2

Arrays

Declaring, populating and manipulating one- and two-dimensional arrays.

OPEN NOTESExplore
8.3

File Handling

Opening, reading, writing and closing data files; storing and retrieving records.

OPEN NOTESExplore
CHAPTER 9

Databases

1 Topic
9.1

Databases

Physical vs logical databases, single-table structures, records, fields, validation and verifying data.

OPEN NOTESExplore
CHAPTER 10

Boolean Logic

1 Topic
10.1

Boolean Logic Gates, Circuits, and Truth Tables

AND, OR, NOT, NAND, NOR and XOR gates and their truth tables; building and completing logic circuits.

OPEN NOTESExplore