Anson Wong
Menu

Computational Thinking and Programming: what HKDSE ICT actually asks

What this topic covers

This topic examines whether a student can think algorithmically and reason about program logic precisely—not whether they can build an app. Many students who genuinely enjoy programming still lose marks here, because the exam asks you to trace, explain, and correct code on paper, under time pressure, rather than to write and run it freely with a compiler catching your mistakes.

Main areas

Computational thinking. Breaking a problem into steps, recognising patterns, and designing an algorithm before worrying about syntax. This is tested through pseudocode and flowcharts as much as through actual code.

Control structures. Sequence, selection (if/else), and iteration (loops)—the three building blocks almost every question ultimately combines in some way. Most marks lost on “harder” questions actually come from a shaky handle on one of these three basics, not from anything exotic.

Program tracing. Given a piece of pseudocode or code and some input, working out exactly what it outputs, step by step, variable by variable. This is arguably the single most exam-relevant skill in the whole topic, and the one that’s hardest to practise passively.

Common data structures and operations. Arrays/lists and basic operations on them (searching, sorting at a conceptual level), which routinely turn up embedded inside larger tracing or design questions.

How the ideas fit together

This topic underpins Algorithm and Programming for students who choose that elective, but it also stands alone in the compulsory part—every candidate is examined on it regardless of elective choice. A shaky grip on control structures here makes elective-level algorithm work considerably harder later.

Common difficulties

The most common failure mode is treating tracing as “read the code and guess the answer” rather than as a mechanical, step-by-step process—writing down each variable’s value after each line, the same way a computer would. Students who can write working code from scratch sometimes trace it badly under exam conditions simply because they never practised the slow, manual version of what a computer does automatically. The second common failure is misreading loop boundaries—off-by-one errors in “does this loop run one more or one fewer time than I think”—which cascades into a wrong final answer even when the overall logic was understood correctly.

What you should be able to do

  • Trace a piece of pseudocode by hand, tracking every variable’s value line by line, and state the final output correctly.
  • Identify sequence, selection, and iteration within a piece of code and explain what each part is doing.
  • Spot and correct a deliberately introduced logic error in a short piece of pseudocode.
  • Design a simple algorithm for a described problem using pseudocode or a flowchart, before being asked to convert it into code.

Get in touch

HKDSE ICT Tutoring