Lecture Notes — Lecture 16: Review and Mini Challenge

Companion to the lecture plan and the worked examples. Read the Definitions before class, the Explanation after it; the practice questions and the lecture quiz close the loop.

Definitions

• Retrieval practice — testing yourself from memory; more effective than rereading - the review lecture applies it deliberately.
• Interleaving — mixing problem types in practice instead of blocking one topic - harder, but transfers better.
• Self-explanation — articulating WHY a step works; the debrief protocol asks for it explicitly.
• Error taxonomy — a personal list of your recurring mistake classes, maintained from quizzes and labs.

Explanation

Review is retrieval, not rereading. Every segment asks students to produce (define, trace, write) before anything is shown. The discomfort of producing from memory is the mechanism.

The case sequence revisits four anchors - modelling, pseudocode discipline, debugging method, testing design - one per block so far, each as an unseen variant of a familiar case family.

Error taxonomies are personal. Students leave with their own list of recurring mistakes and a check per mistake. The taxonomy turns 'I am bad at this' into 'I forget the empty case' - fixable.

Probability and counting preview Block III (lectures 17-24): search, sorting, recursion. The mini challenge plants the seeds: selection, ordering, and exhaustive trials.

Examples

The lecture's worked examples live in examples.md; the case studies this lecture builds on are worked in class from the projector. The case sequence with difficulties:

• cs-061 (Beginner)
• cs-062 (Foundational)
• cs-063 (Intermediate)
• cs-064 (Advanced)

Common misconceptions

• Rereading notes and mistaking fluency for readiness - only retrieval reveals gaps.
• Blocking practice on one topic; the challenge interleaves four topics deliberately.
• Treating the personal error taxonomy as an admission of failure - it is a checklist.
• Blaming the language for aliasing behaviour instead of learning the model.

Summary and key takeaways

1. Produce from memory before reviewing; retrieval is the workout.
2. Keep an error taxonomy and check it before submitting anything.
3. Four anchors - model, pseudocode, debug, test - now cover Blocks I-II.
4. Block III previews: search, sorting, recursion - the same method, harder shapes.

Practice questions

• Write the four-questions grid (input, output, constraints, assumptions) for an unseen scenario in four minutes.
• Trace a provided five-line loop with a table; state what shrinks and why it terminates.
• Debug a two-defect snippet using reproduce / hypothesise / isolate / fix / verify; write the one-line post-mortem.
• Design the test table for a grade-band function: classes, boundaries, adversarial rows; justify the order.

Where this leads

Next lecture: Searching and Linear Scans. The quiz below checks this lecture's essentials before we build on them.