Skip to main content

← back to the guide

O-Level Computing (7155) Algorithms and Problem Solving quiz: flowcharts, pseudocode, searching, sorting, trace tables quiz

15questions. Pick an answer and you'll see why right away.

  1. Which three constructs are the building blocks of every algorithm?

  2. In a flowchart, which symbol represents a decision?

  3. Which flowchart symbol is used for input and output?

  4. Why does binary search require the list to be sorted?

  5. A linear search runs on a list of 20 items. In the worst case, how many items does it compare with the target?

  6. Binary search is applied to the sorted list 2, 5, 9, 14, 21, 33, 40 looking for 21. Which item is compared first?

  7. Which statement about linear search compared with binary search is correct?

  8. What does one full pass of a bubble sort do?

  9. When does a bubble sort know the list is fully sorted?

  10. In pseudocode, which keyword is normally used for counter-controlled iteration over a known number of repetitions?

  11. What is the purpose of a trace table?

  12. A program accepts a mark from 0 to 100. Which value is the best example of boundary test data?

  13. For the same 0 to 100 mark program, which is an example of invalid test data?

  14. Why should you show your working when tracing a sort or search in Paper 1?

  15. Which pseudocode statement correctly assigns the sum of two variables to a third?