S5 ICT: Algorithms and Flowcharts, error rework
- 2026-11-20
S5 ICT: Algorithms and Flowcharts, error rework
Target the six most common slips: the range upper bound, misusing the diamond, search efficiency, path counts, loop counts and trace table rows.
Error rework: six common slips This paper reworks real errors: range(1,5) gives four runs with a sum of 10; a diamond is a decision and a rectangle a process; binary search over 200 sorted items needs at most eight comparisons against 200 for linear search; three two-way decisions give eight paths; binary search over 512 items takes at most nine comparisons; bubble sort on six items makes fifteen comparisons with five in the first pass; tracing 1 to 10 needs eleven rows for a total of 55; adding 4 to k until it is no longer below 30 takes eight iterations ending at 32; merge sort on sixteen items costs at most sixty four comparisons; and the paper closes with the error of believing binary search needs no sorting.
01 Paper details (check answers afterwards)
| Item | Detail |
|---|---|
| Questions | 10 |
| Suggested time | 25 |
| Difficulty mix | Foundation 3 · Intermediate 3 · Challenge 3 · Error redo 1 |
| Chapter | Chapter: S5 ICT: Algorithms and Flowcharts |
| Level | Error rework (10 items) |
02 Questions (10 items)
- FoundationError rework: someone counts `for i in range(1, 5)` as five iterations with a sum of 15. What is correct?
- FoundationError rework: someone treats the flowchart diamond as a process step. What is wrong?
- FoundationError rework: someone claims linear search still beats binary search on sorted data. Is that right?
- IntermediateError rework: someone thinks three decisions give seven paths. How many paths are there really?
- IntermediateBinary search over 512 sorted items takes at most how many comparisons?
- IntermediateBubble sort on six items makes how many comparisons in total, and how many more than the first pass?
- ChallengeTracing a loop that adds 1 to 10 gives how many rows and what total?
- ChallengeWith `k = 0` then adding 4 each round until k is no longer below 30, how many iterations and what final k?
- ChallengeMerge sort on sixteen items makes at most how many comparisons?
- Error redoError rework: someone says binary search needs no sorting. Is that right?
03 Answers and one-line notes
| # | Answer | One-line note |
|---|---|---|
| 1 | Four iterations with a sum of 10. | The upper bound of range is excluded, so the values are 1 to 4, four numbers adding to 10. |
| 2 | A diamond is a decision; a process step uses a rectangle. | A decision has two labelled exits while a process has one, so mixing them hides where branching happens. |
| 3 | No, binary search is far faster once data is sorted. | Binary search halves the range each time, so 200 items need at most eight comparisons against 200 for linear search. |
| 4 | Three two-way decisions give eight paths. | Each added decision doubles the path count, so 2 to the power 3 is 8. |
| 5 | At most nine. | 2 to the power 9 equals 512, and each comparison halves the remaining range. |
| 6 | Fifteen in total, ten more than the five comparisons of the first pass. | Six items give 6 times 5 divided by 2, that is 15 pairs, while the first pass only compares five adjacent pairs. |
| 7 | Eleven rows and a total of 55. | One initialisation row plus ten iterations, and the total is 10 times 11 divided by 2, that is 55. |
| 8 | Eight iterations, ending with k equal to 32. | k runs from 4 up to 32 in steps of four, leaving the loop after the eighth iteration. |
| 9 | At most sixty four. | Each level costs at most sixteen comparisons and there are four levels, so 16 times 4 gives 64. |
| 10 | No, binary search requires sorted data. | Binary search decides which half to keep by comparing values, so unsorted data cannot rule any half out. |
04 What to do after marking
- After marking, redo only the wrong items and write down which step went wrong (formula, unit, or misread number).
- Repeat the same item two days later; move to the next paper only when both attempts are correct.
- Parents only need the answer and note columns; there is no need to explain every item.
Want to draw the flowchart and fill the trace table yourself? Book a TutorZone tutor and unpack all ten items in 25 minutes.Tutor Registration →
Questions and answers are written originally by the TutorZone team and are not taken from any school, publisher or examination authority paper. Every value is checked by computer.



