Algorithms, decisions and loops
CSE101 · Week 03 · Tuesday 6 Oct 2026 · 13:30–16:30 · Z23
Lecture materials
In this lecture
Develop algorithms from inputs, outputs and assumptions. Use flowcharts and pseudocode to describe sequence, selection and repetition, trace state changes, and check boundary cases and termination.
The 62-page slide PDF and illustrated reading include origami and tea-service examples, display memory and the straight-line HI program before branches and a display counter, readable assembly, worked traces, debugging, a C preview and a brief comparison of algorithm efficiency. The reading includes 30 expandable Check and worked answers.
Explore the examples
Display memory and the HI program → · Complete order flowchart → · Further study: algorithms →
Open VizMachine ↗ to connect the algorithm to machine execution.
Practice and coordination
Recitation: Traces with changed inputs; distinguish an address from its contents.