- For 2026–2028, Cambridge IGCSE Computer Science 0478 has two papers: Paper 1 Computer Systems and Paper 2 Algorithms, Programming and Logic, each 1 hour 45 minutes, 75 marks and 50% of the grade.
- In the 2026–2028 syllabus, Paper 2 coding answers must be written in pseudocode, except the 15-mark scenario question, which may be answered in pseudocode, Python, Visual Basic or Java.
- Cambridge pseudocode uses the left arrow (←) for assignment and keyword pairs such as IF…ENDIF, FOR…NEXT, WHILE…ENDWHILE and REPEAT…UNTIL.
- A trace table records the value of every variable and output after each step of an algorithm, one row per change, so it shows exactly how the algorithm runs.
- From 2029, the 0478 papers are renamed Paper 1 Computer Systems and Logic and Paper 2 Algorithms and Programming, and all Paper 2 programming answers must be written in Python.
On this page
IGCSE Computer Science 0478 has two equally weighted papers: Paper 1 Computer Systems (theory) and Paper 2 Algorithms, Programming and Logic (problem-solving). For exams in 2026–2028, Paper 2 coding answers must be in Cambridge-style pseudocode, except the 15-mark scenario question, so learning the pseudocode conventions, trace tables and a method for the scenario is the fastest way to raise your Paper 2 mark.
How is IGCSE Computer Science 0478 assessed?
IGCSE Computer Science 0478 is assessed by two written papers, each lasting 1 hour 45 minutes, worth 75 marks and carrying 50% of the qualification. There is no coursework. Paper 1 covers computer systems topics, and Paper 2 covers algorithm design, programming, databases and Boolean logic.
| Syllabus (exam years) | Paper | Time | Marks | Weighting |
|---|---|---|---|---|
| 2026–2028 | Paper 1 Computer Systems | 1 h 45 min | 75 | 50% |
| 2026–2028 | Paper 2 Algorithms, Programming and Logic | 1 h 45 min | 75 | 50% |
| 2029–2031 | Paper 1 Computer Systems and Logic | 1 h 45 min | 75 | 50% |
| 2029–2031 | Paper 2 Algorithms and Programming | 1 h 45 min | 75 | 50% |
The assessment objectives are AO1 knowledge and understanding (40%), AO2 application, including analysing and designing programming problems (40%), and AO3 evaluating and making reasoned judgements (20%). Check the details for your exam year on the Cambridge IGCSE Computer Science 0478 page.
What changes from 2029?
The 2029–2031 syllabus renames the papers and moves logic gates and circuits to Paper 1. All Paper 2 programming answers must then be written in Python 3.10 or higher, pseudocode is no longer required, calculators are allowed in Paper 2, and the scenario question is split into sub-parts with points-based marking. If you sit in 2026, 2027 or 2028, the pseudocode rules below apply to you.
What is on Paper 1 Computer Systems?
Paper 1 tests six theory topics: data representation, data transmission, hardware, software, the internet and its uses, and automated and emerging technologies. Questions range from short definitions to calculations and longer explanations applied to a scenario.
- Data representation: binary, denary and hexadecimal conversion, binary addition and overflow, logical shifts, two's complement for 8-bit integers, and file-size calculations. In the 2026–2028 syllabus, file sizes use 1024, so 1 KiB = 1024 bytes.
- Data transmission: packet switching, serial and parallel, simplex, half-duplex and full-duplex, error detection (parity, checksum, echo check, check digits, ARQ) and encryption.
- Hardware: the CPU and the fetch–decode–execute (FDE) cycle, cores, cache and clock speed, input and output devices, and primary and secondary storage.
- Software, the internet and emerging technologies: operating systems, interrupts, translators, the web, cyber security threats, robotics and artificial intelligence.
What are the Cambridge pseudocode conventions?
Cambridge pseudocode uses upper-case keywords, the left arrow ← for assignment, and matching start and end keywords for every structure, such as IF…ENDIF and WHILE…ENDWHILE. Following these conventions makes your algorithms easy for examiners to credit, although marks are given for correct logic, not perfect syntax.
| Construct | Cambridge-style pseudocode |
|---|---|
| Declaration | DECLARE Total : INTEGER |
| Constant | CONSTANT Limit ← 30 |
| Assignment | Total ← Total + Mark |
| Input and output | INPUT Mark / OUTPUT "Total: ", Total |
| Selection | IF … THEN … ELSE … ENDIF; CASE OF … OTHERWISE … ENDCASE |
| Count-controlled loop | FOR Index ← 1 TO 10 … NEXT Index |
| Pre-condition loop | WHILE … DO … ENDWHILE |
| Post-condition loop | REPEAT … UNTIL … |
| 1D array | DECLARE Scores : ARRAY[1:30] OF INTEGER |
| Subroutines | PROCEDURE … ENDPROCEDURE; FUNCTION … RETURNS … ENDFUNCTION |
The data types you need are INTEGER, REAL, CHAR, STRING and BOOLEAN. Use meaningful identifiers such as HighestTemp rather than x, indent the contents of every loop and selection, and add comments with // when they make the logic clearer.
How do you complete a trace table? A worked example
To complete a trace table, work through the algorithm one line at a time and write a new value in the table every time a variable changes or something is output. Never skip lines or predict the answer, because examiners mark each column and row against the exact sequence of values.
This original algorithm reads five daily temperatures, finds the highest and counts how many are above 30.
Highest ← -100
Count ← 0
FOR Day ← 1 TO 5
INPUT Temp
IF Temp > Highest
THEN
Highest ← Temp
ENDIF
IF Temp > 30
THEN
Count ← Count + 1
ENDIF
NEXT Day
OUTPUT Highest, CountTrace it with the inputs 28, 33, 31, 25, 35:
| Day | Temp | Highest | Count | OUTPUT |
|---|---|---|---|---|
| -100 | 0 | |||
| 1 | 28 | 28 | 0 | |
| 2 | 33 | 33 | 1 | |
| 3 | 31 | 33 | 2 | |
| 4 | 25 | 33 | 2 | |
| 5 | 35 | 35 | 3 | |
| 35, 3 |
Notice two things examiners like to test. First, Highest starts at -100, not 0, so the algorithm would still work if every temperature were negative. Second, the condition is Temp > 30, so a reading of exactly 30 would not be counted. Questions often ask you to change > to >= or to explain the purpose of a variable, so read conditions carefully.
How should you answer the 15-mark scenario question?
Answer the 15-mark scenario question by turning each requirement in the task into a numbered part of your program, then writing code that meets each one in order. The question is marked as a whole, so a complete, readable program that meets most requirements scores better than a clever fragment.
- List the requirements. Underline every task in the question, such as input with validation, a calculation, a search, or output with a message.
- Use the given names. If the question supplies array names and data, use them exactly. Do not redeclare or refill arrays it says are already populated.
- Validate input. A REPEAT…UNTIL loop with a range or type check is a common requirement and an easy place to earn credit.
- Comment your code. Brief comments help an examiner see which requirement each section meets.
- Output clearly. Print results with labels, such as "Average score: ", rather than bare numbers.
- Choose one language and stick to it. For 2026–2028, the scenario may be answered in pseudocode, Python, Visual Basic or Java; do not mix them.
How long should you spend on the scenario?
Each paper gives you 105 minutes for 75 marks, which is about 1.4 minutes per mark, so plan roughly 20–25 minutes for the 15-mark scenario. Many students find it helps to read the scenario early, then answer the shorter questions while the problem settles, and return to write the full program with time to check it.
How should you revise for 0478?
Revise 0478 by splitting time between theory recall for Paper 1 and hands-on algorithm practice for Paper 2, ideally writing and running small programs every week. Programming skill builds slowly, so start Paper 2 practice early rather than leaving it until the final month.
- Practise the standard methods until you can write them from memory: totalling, counting, finding maximum and minimum, averages, linear search, bubble sort and validation.
- Do one trace table and one "find the error" question every week.
- Learn truth tables for AND, OR, NOT, NAND, NOR and XOR, and practise building logic circuits from expressions.
- Practise SQL queries with SELECT, FROM, WHERE and ORDER BY, including AND and OR conditions.
Quiz Portal's IGCSE Computer Science 0478 practice page has original topical questions and timed mocks for both papers; results are for practice, not official marks. If you plan to continue to A Level, our A Level Computer Science 9618 guide shows how the pseudocode carries forward.
Frequently asked questions
Can I use Python in IGCSE Computer Science Paper 2?
For exams in 2026–2028, Paper 2 coding answers must be in pseudocode, except the 15-mark scenario question, which may use pseudocode, Python, Visual Basic or Java. From 2029, all Paper 2 programming answers must be written in Python.
How long is IGCSE Computer Science Paper 2?
Paper 2 lasts 1 hour 45 minutes and is worth 75 marks, which is 50% of the qualification. Paper 1 has the same duration and marks.
What symbol is used for assignment in Cambridge pseudocode?
Cambridge pseudocode uses a left-pointing arrow (←) for assignment, for example Total ← Total + 1. The equals sign is used for comparison.
How do I fill in a trace table?
Work through the algorithm line by line and record a new value whenever a variable changes or the algorithm outputs something. Follow the exact order of execution, including every loop iteration.
Does spelling or syntax matter in pseudocode answers?
Examiners mark the logic, so small syntax slips are usually not penalised, but clear Cambridge-style keywords and indentation make it much easier for your algorithm to be credited.
Quiz Portal is independent and is not affiliated with Cambridge University Press & Assessment or College Board. Practice questions in this guide are original.