Career upgrade: Learn practical AI skills for better jobs and higher pay.
Level up
All Practice Exams

100+ Free IGCSE Computer Science Practice Questions

Pass your Cambridge IGCSE Computer Science (0478/0984) exam on the first try — instant access, no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free
1 / 100
Question 1
Score: 0/0

A logical left shift of 2 places is performed on the 8-bit value 00011011. What is the result?

A
B
C
D
to track
2026 Statistics

Key Facts: IGCSE Computer Science Exam

0478 and 0984

Cambridge IGCSE Computer Science syllabus codes

Cambridge International

2 papers

Paper 1 Theory + Paper 2 Problem-solving

Cambridge 0478 syllabus 2026

150 marks

Total marks (75 + 75)

Cambridge International

100

Free practice questions here

OpenExamPrep

Cambridge IGCSE Computer Science 0478/0984 is assessed through two timed written papers: Paper 1 Theory and Paper 2 Problem-solving and Programming, each 1h 45m and 75 marks. The 2026 syllabus covers data representation, hardware, software, networks, cyber security, algorithm design, Cambridge pseudocode programming, and SQL databases.

Sample IGCSE Computer Science Practice Questions

Try these sample questions to test your IGCSE Computer Science exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1Convert the denary number 156 to 8-bit binary.
A.10011100
B.11001100
C.10101100
D.10011010
Explanation: 156 = 128 + 16 + 8 + 4 = 10011100. Place values from left: 128, 64, 32, 16, 8, 4, 2, 1. Select 128, 16, 8 and 4 to give 1 in those columns.
2Convert the hexadecimal value 2F to denary.
A.47
B.31
C.215
D.79
Explanation: Hex 2F = (2 x 16) + (15 x 1) = 32 + 15 = 47. The digit F in hex represents the value 15.
3What is the denary value of the 8-bit two's complement number 11110001?
A.-15
B.-1
C.241
D.-127
Explanation: In two's complement, invert the bits to get 00001110 and add 1 to get 00001111 = 15. The original is negative, so the value is -15.
4Perform the binary addition 01011010 + 00110011 in 8 bits. What is the result?
A.10001101
B.01101101
C.10001100
D.10001111
Explanation: Add column by column from the right, carrying where needed: 01011010 + 00110011 = 10001101 (90 + 51 = 141). No overflow into a 9th bit.
5A logical left shift of 2 places is performed on the 8-bit value 00011011. What is the result?
A.01101100
B.00000110
C.11011000
D.01101111
Explanation: Shifting left by 2 multiplies by 4 and fills the right with zeros: 00011011 -> 01101100. Equivalent to 27 x 4 = 108.
6Which statement about ASCII and Unicode is correct?
A.ASCII uses 7 or 8 bits per character; Unicode UTF-16 uses 16 or more bits to support many languages
B.ASCII and Unicode both use exactly 8 bits per character
C.Unicode is older than ASCII and uses fewer bits per character
D.ASCII can represent every character in every world language
Explanation: Standard ASCII is 7-bit (extended ASCII is 8-bit) and covers only 128 (or 256) characters. Unicode (UTF-8 variable, UTF-16 typically 16-bit) supports tens of thousands of characters across world scripts.
7A 10-second mono sound clip is sampled at 44 100 Hz with a sample resolution of 16 bits. What is the approximate file size?
A.882 000 bytes
B.441 000 bytes
C.176 400 000 bytes
D.44 100 bytes
Explanation: File size in bits = sample rate x bit depth x time = 44 100 x 16 x 10 = 7 056 000 bits. Divide by 8 to get bytes: 882 000 bytes.
8An image is 800 pixels wide by 600 pixels high with a colour depth of 24 bits per pixel. What is the file size in bytes (ignoring metadata)?
A.1 440 000 bytes
B.11 520 000 bytes
C.480 000 bytes
D.57 600 bytes
Explanation: Size = width x height x colour depth = 800 x 600 x 24 = 11 520 000 bits. Divide by 8 to convert to bytes: 1 440 000 bytes.
9Which best describes lossless compression compared with lossy compression?
A.Lossless preserves all original data so the file can be perfectly restored; lossy permanently removes some data to achieve smaller files
B.Lossless always produces smaller files than lossy compression
C.Lossless removes data the user cannot perceive; lossy keeps all data intact
D.Both lossless and lossy compression permanently discard data
Explanation: Lossless compression (e.g. RLE, Huffman, ZIP) keeps every bit and is reversible. Lossy compression (e.g. JPEG, MP3) discards detail the eye or ear is less sensitive to, giving smaller files but no exact restoration.
10Using run-length encoding, how would the string AAAABBBCCDAA be encoded most compactly as (character, count) pairs?
A.A4 B3 C2 D1 A2
B.A12
C.A6 B3 C2 D1
D.ABCDA 4 3 2 1 2
Explanation: RLE replaces runs of identical characters with the character followed by the run length: AAAA = A4, BBB = B3, CC = C2, D = D1, AA = A2. Runs of A are separate because they are not contiguous.

About the IGCSE Computer Science Exam

Cambridge IGCSE Computer Science (0478 and the 9-1 variant 0984) is the international General Certificate of Secondary Education awarded by Cambridge Assessment International Education. The syllabus covers data representation, transmission, hardware, software, internet uses, algorithm design, programming in Cambridge pseudocode, and databases through two written papers — Paper 1 Theory and Paper 2 Problem-solving and Programming.

Questions

100 scored questions

Time Limit

3 hours total — Paper 1 (1h 45m) + Paper 2 (1h 45m)

Passing Score

Grade C is the standard pass (A*-G grading; A*-C considered strong pass)

Exam Fee

£40-£90 per subject (school-set entry fee) (Cambridge Assessment International Education (CAIE))

IGCSE Computer Science Exam Content Outline

~10%

Data Representation

Binary, denary and hex conversion; two's complement; binary addition; logical and arithmetic shifts; ASCII vs Unicode UTF-8/UTF-16; sound sampling rate and bit depth; image resolution and colour depth; lossy vs lossless compression including run-length encoding and Huffman coding; bit/byte/KiB/MiB/GiB units

~10%

Data Transmission

Serial vs parallel transmission; simplex, half-duplex and full-duplex; packet switching with header/payload/trailer; error detection by parity bit, ARQ, checksum and echo check; USB; HTTP vs HTTPS; URL components (protocol, domain, path)

~15%

Hardware

CPU components (control unit, ALU, registers MAR/MDR/PC/CIR/Accumulator, buses); fetch-execute cycle; factors affecting CPU performance; embedded vs general-purpose systems; RAM vs ROM and virtual memory; primary, secondary and off-line storage (HDD, SSD, optical, cloud); input and output devices including sensors

~10%

Software

System vs application software; operating system functions (multitasking, memory/file/peripheral/process management, UI, security); utility programs (antivirus, defragmenter, backup, compression); high-level vs low-level languages; compiler vs interpreter vs assembler; IDE features (editor, run-time environment, error diagnostics, auto-completion)

~10%

Internet and its Uses

URL structure; HTML structure and presentation; CSS; client-side vs server-side scripting; session vs persistent cookies; digital currency and blockchain basics; cyber security threats (brute force, DDoS, malware types, pharming, phishing, social engineering); solutions (access levels, anti-malware, authentication, firewalls, proxy servers, SSL/TLS)

~15%

Algorithm Design and Problem Solving

Computational thinking (decomposition, pattern recognition, abstraction); pseudocode and flowchart symbols; trace tables; identifying syntax, logic and runtime errors; structure diagrams; validation (range, type, length, presence, format) vs verification (visual, double entry); test data types; linear search, binary search, bubble sort, insertion sort

~20%

Programming

Cambridge pseudocode constructs (DECLARE, INPUT/OUTPUT, IF/THEN/ELSE, CASE OF, FOR/NEXT, WHILE, REPEAT/UNTIL); data types (INTEGER, REAL, STRING, CHAR, BOOLEAN); arithmetic and comparison operators including MOD and DIV; logical operators; string functions LENGTH, SUBSTRING, UCASE, LCASE; 1D and 2D arrays indexed from 1; procedures and functions; reading and writing files

~10%

Databases

Flat files vs relational databases; tables, records and fields; primary key and foreign key; one-to-one, one-to-many and many-to-many relationships; SQL basics (SELECT, FROM, WHERE, ORDER BY ASC/DESC, AND, OR, LIKE with wildcards); first normal form to remove repeating groups

How to Pass the IGCSE Computer Science Exam

What You Need to Know

  • Passing score: Grade C is the standard pass (A*-G grading; A*-C considered strong pass)
  • Exam length: 100 questions
  • Time limit: 3 hours total — Paper 1 (1h 45m) + Paper 2 (1h 45m)
  • Exam fee: £40-£90 per subject (school-set entry fee)

Keys to Passing

  • Complete 500+ practice questions
  • Score 80%+ consistently before scheduling
  • Focus on highest-weighted sections
  • Use our AI tutor for tough concepts

IGCSE Computer Science Study Tips from Top Performers

1Learn the Cambridge pseudocode reference (DECLARE, INPUT, OUTPUT, FOR/NEXT, REPEAT/UNTIL) — examiners reward correct pseudocode style
2Practise denary, binary and hex conversions until they are automatic; they appear on almost every Paper 1
3Use trace tables on every pseudocode question to track variable values step by step
4Memorise the fetch-execute cycle stages and register names (MAR, MDR, PC, CIR, ACC) — they recur every year

Frequently Asked Questions

What is Cambridge IGCSE Computer Science (0478/0984)?

Cambridge IGCSE Computer Science is the international GCSE in computer science awarded by Cambridge Assessment International Education. Syllabus 0478 uses A*-G grading and 0984 is the 9-1 graded variant used in some UK schools. Both follow the same content.

How many papers does IGCSE Computer Science have?

There are two written papers. Paper 1 (Theory) is 1h 45m and 75 marks, covering data representation, hardware, software, networks and cyber security. Paper 2 (Problem-solving and Programming) is also 1h 45m and 75 marks, covering algorithms, pseudocode and databases.

Do I have to learn a specific programming language for IGCSE Computer Science?

The exam is language-agnostic. Cambridge pseudocode is used in the question paper and in mark schemes. Schools commonly teach Python, Visual Basic or Java in lessons, but exam answers should normally be written in Cambridge pseudocode or in an accepted high-level language.

When are the IGCSE Computer Science exams taken?

Cambridge IGCSE exams run in three series each year: February-March (selected regions), May-June, and October-November. Most candidates sit Computer Science in the May-June series at the end of Year 11.