/en-tutor-prep-s2-ict-algorithms-flowcharts-practice-4/
/en-tutor-prep-s2-ict-algorithms-flowcharts-practice-4/
General Inquiry: info@TutorZone.com.hk
Office Hours: Monday to Saturday - 9:00 AM to 6:00 PM
WhatsApp Monday to Sunday - 24 hours
Hotline: +852 6828 1809
Instant Support: +852 9061 3106

Paper 4: Ten common mistakes about algorithms

Paper 4: Ten common mistakes about algorithms

  • 2026-11-21

Paper 4: Ten common mistakes about algorithms

Chapter practice with ten items, answers and a one-line note for each, about 25 minutes.

Paper 4 Ten items on this chapter with answers for immediate marking.

01 Paper details (check answers afterwards)

Item Detail
Questions 10
Suggested time 25
Difficulty mix Foundation 4 · Intermediate 2 · Challenge 2 · Error redo 2
Chapter Chapter: S2 ICT: algorithms and flowcharts
Level Retry

02 Questions (10 items)

  1. FoundationCorrect the error: a diamond is used to show input.
  2. FoundationCorrect the error: a condition is written as if x = 10.
  3. FoundationCorrect the error: a while loop never updates its counter.
  4. FoundationCorrect the error: for i in range(1, 5) reaches i equal to 5.
  5. IntermediateCorrect the error: an algorithm may have infinitely many steps.
  6. IntermediateCorrect the error: a flowchart is always read from bottom to top.
  7. ChallengeCorrect the error: decisions and calculations use the same flowchart symbol.
  8. ChallengeCorrect the error: the longer the code, the better the algorithm.
  9. Error redoCorrect the error: when tracing a program you can ignore initial values.
  10. Error redoCorrect the error: a problem can only have one algorithm.

03 Answers and one-line notes

# Answer One-line note
1 Input uses a parallelogram; a diamond only shows a decision. A diamond needs two exits while input has one, so the two symbols cannot be swapped.
2 It should be written as x == 10; a single equals sign assigns. Writing x = 10 stores 10 into x, so the test is always true and the result is not what was intended.
3 The counter must be updated inside the loop, or the test never fails and the loop never ends. The usual slip is a missing increment line, so the same round repeats forever.
4 It does not; the last value is 4 and the body runs four times. The end value of range is excluded, so covering 5 needs range(1, 6).
5 An algorithm must be finite and finish within a limited number of steps. Finiteness is a basic requirement; a process that never ends is not an algorithm.
6 A flowchart is normally read from top to bottom, following the arrows. The arrows define the order, and charts usually grow downward from the start symbol at the top.
7 Decisions use a diamond and calculations or assignments use a rectangle. A diamond has two exits and a rectangle one, so mixing them loses the branch.
8 An algorithm is judged on correctness, few steps and low resource use. One problem may have several algorithms with very different efficiency, so length is no measure.
9 Every variable must be given its starting value first, or the trace is undetermined. An accumulator or counter without an initial value is already wrong at the first step.
10 A problem can have many algorithms with different efficiency and style. Sorting, for example, can use bubble sort or merge sort with the same result but very different step counts.

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 the whole chapter? See all four difficulty papers on the chapter page.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.

Join as a tutor or coach — academic, music, sports, arts, STEM. Free to register. See how it works →