/en-tutor-prep-s5-ict-algorithms-flowchart-practice-1/
/en-tutor-prep-s5-ict-algorithms-flowchart-practice-1/
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

S5 ICT: Algorithms and Flowcharts, basics

S5 ICT: Algorithms and Flowcharts, basics

  • 2026-11-20

S5 ICT: Algorithms and Flowcharts, basics

Start from the three control structures, flowchart symbols, loop counts and search comparisons to build the foundations of DSE ICT algorithm questions.

Basics: structures, symbols and counts This paper covers the entry points of algorithms: the three control structures are sequence, selection and iteration; a diamond is a decision while a rectangle is a process; a loop of ten prints ten numbers; range(1,6) runs five times with a sum of 15; binary search over 1 000 items takes at most ten comparisons since 2 to the power 10 is 1 024; linear search over ten items needs ten in the worst case; a trace table records one step per row; a flowchart has one entry and possibly several exits; bubble sort on five items makes four comparisons in the first pass and ten in total.

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 Basics (10 items)

02 Questions (10 items)

  1. FoundationWhich three basic control structures make up all program logic?
  2. FoundationWhat does the diamond symbol mean in a flowchart?
  3. FoundationA loop runs ten times and prints one number each round. How many numbers are printed?
  4. IntermediateHow many iterations does `for i in range(1, 6)` run, and what is the sum of i?
  5. IntermediateSearching 1 000 sorted items by binary search takes at most how many comparisons?
  6. IntermediateA linear search over ten items needs how many comparisons in the worst case?
  7. ChallengeHow many steps should each row of a trace table record?
  8. ChallengeHow many entry and exit points does a flowchart have?
  9. ChallengeSorting five items by bubble sort takes how many comparisons in the first pass?
  10. Error redoError check: someone draws a decision as a rectangle. What is wrong?

03 Answers and one-line notes

# Answer One-line note
1 Sequence, selection and iteration. Any program can be built from these three structures, which is the basis of structured programming.
2 It represents a decision. A diamond holds a condition, and its two exits must be labelled to show whether the condition holds.
3 Ten. The number of prints equals the number of iterations, not the number of statements inside the loop.
4 It runs five times and the sum is 15. range starts at 1 and stops before 6, so 1+2+3+4+5 gives 15.
5 At most ten. Each comparison halves the range, and 2 to the power 10 is 1 024, which covers 1 000 items.
6 Ten. In the worst case every item is checked, up to the last one, before the result is known.
7 One step. One step per row lets you check each variable change, while mixing steps hides where it goes wrong.
8 One entry, and possibly several exits. Every extra exit comes from a decision branch and must be labelled with its condition.
9 Four comparisons. Adjacent pairs give four comparisons for five items, after which the largest value is at the end.
10 A rectangle is a process step; a decision must be a diamond. Mixing up the symbols hides where the branching happens, so the flowchart no longer works.

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.

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