Source guide, conventions and coverage
On this page 2 headings
This week is based on all nine supplied lecture transcripts, all three tutorials, and the supplied slide versions of Lectures 3.1 and 3.6–3.9. Repeated PDF copies cover the same source lesson; they do not create extra topics.
| Source | Where to study it |
|---|---|
| Lecture 3.1 | From cards to tables: rows, columns and IDs |
| Lecture 3.1 | One bill, many items: link two tables |
| Lecture 3.2 | Below average: finish one pass before filtering |
| Lecture 3.2 | Find the range, then assign grade bands |
| Lecture 3.3 | Test an idea: are frequent words short? |
| Lecture 3.4 | The three-prizes problem: decide the rules first |
| Lectures 3.4 and 3.8 | Keep the top three: shift safely and handle ties |
| Lectures 3.5 and 3.6 | Procedures, parameters and return values |
| Lectures 3.5 and 3.7 | Call one maximum procedure four times |
| Lecture 3.8 | Build the prize algorithm from smaller procedures |
| Lectures 3.4 and 3.8 | Ties and impossible criteria: finish the specification |
| Lecture 3.9 | Side effects: returning a number can change a deck |
| Lecture 3.9; Lecture 3.6 | Write a contract: inputs, result and allowed changes |
| Tutorials 3.1 and 3.2 | Tutorial lab: nouns, bill averages and expenditure bands |
| Tutorial 3.3 | Call procedures correctly: name, count and order |
Conventions used in these notes
Use the original course score, word and shopping-bill records throughout. CardNo and SerialNumber start at 0; BillNo starts at 1. Grade examples use the exact inclusive integer bounds shown. Word frequencies use lowercase keys and remove only end punctuation, preserving internal hyphens. Word hypotheses count 47 different normalized words; the average length uses 65 occurrences.
The strict inequalities in the lecture’s TopThreeMarks keep distinct mark levels. The eligibility check includes equality with >=. Prize totals and IDs must move together. The supplied winners have distinct totals, so their final selection has no prize-boundary tie; general datasets still need an explicit tie policy.
Pseudocode uses = for assignment and == for equality. X[Field] reads a field selected by name; X.Mathematics reads a fixed named field. A report-and-stop branch inside a procedure ends that procedure rather than ending every unrelated activity on the site.
Source slips and limitations
The reported 329 letters over 65 words give 5.0615, not slightly under 5. The four distinct-word boxes total 47:8,1,15,23. A sentence about a “single topper” establishes existence when maxima agree, not uniqueness. These notes make those distinctions explicit rather than repeating spoken arithmetic slips.
The three-prize rules are an educational example, not an official award or grading policy. Simplified pronoun matching is a task-specific search rule, not a complete language-understanding method. All illustrations are separate image files, displayed at natural aspect ratios with the shared site watermark.