中文（繁體）
中文（简体）
English
IGCSE Computer Science Past Papers & Drilling (Paper 2): Pseudocode, Flowcharts, Logic
TUTORZONE ORIGINAL DRILLING MOCK · CAMBRIDGE IGCSE COMPUTER SCIENCE (0478) PAPER 2
Written to the Cambridge 0478 syllabus (2026-2028): Paper 2 Algorithms, Programming and Logic, 75 marks, 50%, 1 h 45 min (short-answer + structured + a scenario question). This is a Paper 2 drilling mock: 10 questions for 75 marks with answers and techniques.
What is in IGCSE Computer Science Paper 2?
Direct answer: Paper 2 Algorithms, Programming and Logic, 75 marks, 50%, 1 h 45 min.
Assessment at a glance (2027)
| Component | Content | Weighting | Duration |
|---|---|---|---|
| Paper 2 (Algorithms, Programming and Logic) | Short-answer + structured + scenario, 75 marks | 75 marks (50%) | 1 h 45 min |
| Paper 1 (Computer Systems) | Short-answer and structured, 75 marks | 75 marks (50%) | 1 h 45 min |
IGCSE Computer Science Paper 2 drilling technique: 10 questions in 1 h 45 min. Indent pseudocode blocks, trace loops line by line, and write full truth tables for logic gates.
How this paper was built
This is a TutorZone original drilling mock: the questions follow the Cambridge 0478 structure (Paper 2, 75 marks, 50%) and the answers are our own, not Cambridge past papers or marking references.
The loop-trace answer was recomputed programmatically.
Pacing
| Section | Marks | Suggested time | What to do first |
|---|---|---|---|
| Paper 2 (Algorithms, Programming and Logic) | 75 marks (50%) | about 10 min each, allow time for pseudocode | indent pseudocode, write truth tables |
| Paper 1 (Computer Systems) | 75 marks (50%) | show steps for binary | hardware, software, networks, security |
What is the difference between FOR and WHILE loops?
Direct answer: FOR repeats a known number of times (count-controlled); WHILE repeats while a condition is true (condition-controlled).
Paper 2: structured drilling (10 questions, 75 marks)
Indent pseudocode, trace loops line by line, and write truth tables.
Question 1 (7 marks)
Write pseudocode to input two numbers and output the larger one.
Question 2 (7 marks)
What shape is used for start/end in a flowchart? What about a decision?
Question 3 (8 marks)
Explain the difference between a variable and a constant.
Question 4 (8 marks)
Trace: FOR i <- 1 TO 3, do sum <- sum + i. If sum starts at 0, what is sum after the loop?
Question 5 (8 marks)
Explain the difference between a count-controlled (FOR) and a condition-controlled (WHILE) loop.
Question 6 (8 marks)
Give the truth table for an AND gate with two inputs A and B.
Question 7 (7 marks)
Invert an input X with a NOT gate; give the output for X=1 and X=0.
Question 8 (8 marks)
Explain what a one-dimensional array is and give an example of its use.
Question 9 (7 marks)
Describe how bubble sort works.
Question 10 (7 marks)
Describe linear search and state its maximum number of comparisons.
What is the AND gate truth table?
Direct answer: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.
Paper 2 answers
Question 1
INPUT a, b
IF a > b THEN
OUTPUT a
ELSE
OUTPUT b
ENDIF (7)
Question 2
Start/end uses a rounded rectangle (capsule) (4); a decision uses a diamond (3).
Question 3
A variable‘s value can change during execution (4); a constant‘s value is fixed (4).
Question 4
sum = 0+1+2+3 = 6 (8).
Question 5
FOR repeats a known number of times (4); WHILE repeats while a condition is true, an unknown number of times (4).
Question 6
0 AND 0 = 0; 0 AND 1 = 0; 1 AND 0 = 0; 1 AND 1 = 1 (8).
Question 7
X=1 -> output 0; X=0 -> output 1 (7).
Question 8
An array is an indexed collection of same-type elements (4); e.g. storing 10 students’ marks, scores[0..9] (4).
Question 9
Compare adjacent elements and swap them if out of order, repeating passes until sorted (7).
Question 10
Check each element in turn from the first until found or the end (4); worst case for n elements is n comparisons (3).
How does bubble sort work?
Direct answer: compare adjacent elements and swap if out of order, repeating passes until sorted.
Where these marks are usually lost
| Mistake | What it looks like | What it costs | Instead |
|---|---|---|---|
| Loop trace off-by-one | sum as 5 | 1+2+3 = 6 | sum = 6 |
| AND truth table | 1 AND 0 as 1 | AND needs both 1 for 1 | Only 1 AND 1 = 1 |
| FOR/WHILE mixed | FOR as condition loop | FOR is count, WHILE is condition | FOR=count, WHILE=condition |
How to use this paper
First drill: the full 1 h 45 min on all 10 questions with no references.
Mark it: check pseudocode indentation, loop traces and truth tables.
Second drill: redo three to seven days later, aiming to finish inside 1 h 30 min.
What should I do after drilling this paper?
Direct answer: log questions with wrong loop traces or truth tables; redo in three to seven days; and drill Paper 1 Computer Systems.
FAQ
Is this a Cambridge past paper?
No. The questions and answers are TutorZone originals, not Cambridge past papers or marking references.
What does Paper 2 test?
Algorithms (pseudocode, flowcharts), programming (variables, loops, conditions, arrays) and logic (gates, truth tables), 75 marks, 50%.
What is 1 AND 1?
1 (an AND gate outputs 1 only when both inputs are 1).
Official references
| Resource | What to check |
|---|---|
| Cambridge IGCSE Computer Science 0478 syllabus (2026-2028) | Confirm the Paper 1/2 marks and times |
| https://www.tutorzone.com.hk/en-igcse-computer-science-0478-paper-1-mock-2027/ | IGCSE Computer Science Paper 1 drilling mock |
Related: practice area · IGCSE Computer Science Paper 1 drilling mock · IGCSE ICT 0417 Paper 1 drilling mock · IGCSE English 0500 mock
Next step: find a tutor / register as a tutor
After drilling, the hard part is telling a conceptual error from a writing error. Tell us the year group, the school and your available times, and TutorZone will match you with a tutor who knows the HKEAA assessment requirements.
Demand for tutors in this subject is steady, and those who can explain the marking scheme and where marks are won are especially sought after. Register free; you pay only when a match succeeds.
