CSE101 lecture materials
Week 03
6 Oct–9 Oct 2026 · Algorithms, decisions and loops
Tuesday 6 Oct · CSE101
13:30–16:30 · Z23
Principles
Problem formulation, flowcharts and pseudocode; sequence, selection and repetition; correctness and termination, with a first look at efficiency.
Application & programming
Trace display output, decisions and loops in VizMachine; connect algorithm descriptions to readable assembly and a short C preview.
Week 3 slides are available above. The companion reading is available above. Recordings are in preparation.
Learning focus
Describe an algorithm and trace sequence, selection and repetition. Explain immediate values versus addresses, trace load/add/store and display output, and test a short loop for termination.
D: do independently · M: explain and modify a worked example · R: recognize, trace and compare.
Revisit: Signedness; address versus value.
Wednesday 7 Oct · Recitation
Traces with changed inputs; distinguish an address from its contents.
Start time tentatively 16:30; room to be announced.
Friday 9 Oct · CSE107
Lab 02: Assembly: arithmetic & tracing
Trace and modify a short straight-line assembly program.
Attend your assigned two-hour group. Handout in preparation.
Preparation & submissions
No assignment has been released for this page yet. Requirements, permitted assistance and deadlines will appear in the published brief.