Opening Paperstreak

O Level Computer Science past papers › Topics

Test data and trace tables past paper questions

O Level Computer Science 2210 · Algorithm design and problem-solving. Suggest and apply suitable test data Algorithm design and problem-solving Complete a trace table to document a dry-run of an algorithm Normal, abnormal, extreme and boundary test data; trace tables for algorithms in flowcharts or pseudocode.

In Cambridge O Level Computer Science 2210, Test data and trace tables came up in 12 of the 34 papers on Paperstreak, for about 8 marks a paper when it does. It last came up in October/November 2025.

Often set with Explaining the purpose of an algorithm, Finding and correcting errors, Validation and verification, Standard methods (searching, sorting, totalling, counting).

21 questions, newest first

  1. 2210/22/O/N/25 Question 3 · 6 marks
  2. 2210/22/O/N/25 Question 5 part (a) · 6 marks
  3. 2210/23/O/N/25 Question 5 part (a) · 4 marks
  4. 2210/23/O/N/25 Question 6 part (a) · 2 marks
  5. 2210/21/M/J/25 Question 1 · 1 mark
  6. 2210/21/M/J/25 Question 10 part (a) · 3 marks
  7. 2210/22/M/J/25 Question 3 · 4 marks
  8. 2210/22/M/J/25 Question 6 part (a) · 6 marks
  9. 2210/22/O/N/24 Question 7 part (a) · 5 marks
  10. 2210/22/O/N/24 Question 8 · 4 marks
  11. 2210/23/O/N/24 Question 7 · 9 marks
  12. 2210/23/O/N/24 Question 10 part (a) · 6 marks
  13. 2210/21/M/J/24 Question 6 part (a) · 7 marks
  14. 2210/22/M/J/24 Question 9 part (a) · 5 marks
  15. 2210/22/O/N/23 Question 2 part (b) · 4 marks
  16. 2210/22/O/N/23 Question 6 part (a) · 5 marks
  17. 2210/23/O/N/23 Question 4 part (c) · 2 marks
  18. 2210/23/O/N/23 Question 8 part (a) · 5 marks
  19. 2210/21/M/J/23 Question 3 part (b) · 6 marks
  20. 2210/21/M/J/23 Question 7 part (a) · 4 marks
  21. 2210/22/M/J/23 Question 9 part (a) · 5 marks

More in Algorithm design and problem-solving: Development life cycle and decomposition, Explaining the purpose of an algorithm, Standard methods (searching, sorting, totalling, counting), Validation and verification, Finding and correcting errors, Writing and amending algorithms.

Questions and mark schemes from Cambridge International past papers. Paperstreak isn't affiliated with Cambridge.