Cambridge IGCSE Question Simulator

IGCSE Computer Science (0478)

Algorithm design and problem-solving Banker

44 questions · about 20% of the marks we indexed · examined in 9 of 9 sessions.

Questions by year

2026

  • 2026 May/June · Paper 22 · Q3 (a(i), a(ii), b, c)11 marksValidation and verification
  • 2026 May/June · Paper 22 · Q46 marksProgram development life cycle, decomposition and design methods
  • 2026 May/June · Paper 22 · Q5 (a, b, c)10 marksFinding and correcting errors in algorithms · Standard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2026 May/June · Paper 22 · Q6 (a, b)7 marksTrace tables · Writing, completing and explaining algorithms and flowcharts

2025

  • 2025 Oct/Nov · Paper 22 · Q2 (a, c(i), c(ii))9 marksFinding and correcting errors in algorithms · Standard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2025 Oct/Nov · Paper 22 · Q36 marksTest data
  • 2025 Oct/Nov · Paper 22 · Q4 (a)1 markValidation and verification
  • 2025 Oct/Nov · Paper 22 · Q5 (a, b)9 marksTrace tables · Writing, completing and explaining algorithms and flowcharts
  • 2025 May/June · Paper 22 · Q11 markProgram development life cycle, decomposition and design methods
  • 2025 May/June · Paper 22 · Q23 marksProgram development life cycle, decomposition and design methods
  • 2025 May/June · Paper 22 · Q34 marksTest data
  • 2025 May/June · Paper 22 · Q4 (a, b)7 marksValidation and verification
  • 2025 May/June · Paper 22 · Q5 (a, c)9 marksFinding and correcting errors in algorithms · Standard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2025 May/June · Paper 22 · Q6 (a, b, c)10 marksTrace tables · Writing, completing and explaining algorithms and flowcharts
  • 2025 May/June · Paper 22 · Q7 (a)6 marksWriting, completing and explaining algorithms and flowcharts

2024

  • 2024 Oct/Nov · Paper 22 · Q11 markProgram development life cycle, decomposition and design methods
  • 2024 Oct/Nov · Paper 22 · Q3 (a, b)10 marksWriting, completing and explaining algorithms and flowcharts
  • 2024 Oct/Nov · Paper 22 · Q4 (a, b)8 marksFinding and correcting errors in algorithms · Standard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2024 Oct/Nov · Paper 22 · Q5 (a, b)4 marksProgram development life cycle, decomposition and design methods
  • 2024 Oct/Nov · Paper 22 · Q62 marksValidation and verification
  • 2024 Oct/Nov · Paper 22 · Q7 (a, b, c)8 marksTrace tables · Writing, completing and explaining algorithms and flowcharts
  • 2024 Oct/Nov · Paper 22 · Q84 marksTest data
  • 2024 May/June · Paper 22 · Q11 markProgram development life cycle, decomposition and design methods
  • 2024 May/June · Paper 22 · Q33 marksProgram development life cycle, decomposition and design methods
  • 2024 May/June · Paper 22 · Q4 (a, b(i), b(ii))10 marksValidation and verification
  • 2024 May/June · Paper 22 · Q6 (a, b)8 marksStandard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2024 May/June · Paper 22 · Q7 (b)3 marksFinding and correcting errors in algorithms
  • 2024 May/June · Paper 22 · Q9 (a, b)7 marksStandard methods (totalling, counting, max/min, linear search, bubble sort) · Trace tables

2023

  • 2023 Oct/Nov · Paper 22 · Q11 markValidation and verification
  • 2023 Oct/Nov · Paper 22 · Q2 (a, b, c)7 marksTest data · Validation and verification
  • 2023 Oct/Nov · Paper 22 · Q3 (b)4 marksStandard methods (totalling, counting, max/min, linear search, bubble sort)
  • 2023 Oct/Nov · Paper 22 · Q4 (a, b)9 marksFinding and correcting errors in algorithms · Writing, completing and explaining algorithms and flowcharts
  • 2023 Oct/Nov · Paper 22 · Q6 (a, b)7 marksTrace tables · Writing, completing and explaining algorithms and flowcharts
  • 2023 May/June · Paper 22 · Q11 markProgram development life cycle, decomposition and design methods
  • 2023 May/June · Paper 22 · Q33 marksProgram development life cycle, decomposition and design methods
  • 2023 May/June · Paper 22 · Q4 (a, b(i), b(ii))7 marksValidation and verification
  • 2023 May/June · Paper 22 · Q7 (b, c)7 marksFinding and correcting errors in algorithms · Validation and verification
  • 2023 May/June · Paper 22 · Q9 (a, b)7 marksStandard methods (totalling, counting, max/min, linear search, bubble sort) · Trace tables

2022

  • 2022 Oct/Nov · Paper 22 · Q33 marksValidation and verification
  • 2022 Oct/Nov · Paper 22 · Q42 marksTest data
  • 2022 Oct/Nov · Paper 22 · Q5 (a, b)8 marksFinding and correcting errors in algorithms · Writing, completing and explaining algorithms and flowcharts
  • 2022 Oct/Nov · Paper 22 · Q65 marksTrace tables
  • 2022 May/June · Paper 22 · Q2 (a, b, c)11 marksFinding and correcting errors in algorithms · Test data · Validation and verification
  • 2022 May/June · Paper 22 · Q4 (a, b, c)9 marksTrace tables · Writing, completing and explaining algorithms and flowcharts

Find the full paper on the official Cambridge past-papers page or ask your school. “Paper 42” means Paper 4, variant 2.

Similar questions

Questions that test the same subtopic in different years. Practise them together to master one skill.

Validation and verification Banker11 questions · 9/9 sessions
Trace tables Banker9 questions · 9/9 sessions
Writing, completing and explaining algorithms and flowcharts 10 questions · 7/9 sessions
Finding and correcting errors in algorithms Banker9 questions · 9/9 sessions
Standard methods (totalling, counting, max/min, linear search, bubble sort) 8 questions · 7/9 sessions
Test data 6 questions · 6/9 sessions
Program development life cycle, decomposition and design methods 9 questions · 5/9 sessions

Subtopics

SubtopicMarks indexedSessions
Validation and verification Banker539/9
Trace tables Banker509/9
Writing, completing and explaining algorithms and flowcharts 407/9
Finding and correcting errors in algorithms Banker369/9
Standard methods (totalling, counting, max/min, linear search, bubble sort) 337/9
Test data 246/9
Program development life cycle, decomposition and design methods 235/9

← All Computer Science topics