Sources, dataset conventions and coverage
These beginner notes cover all eight Week 4 lectures and all three tutorials supplied for Computational Thinking. The PDFs are teaching sources; their contents are not instructions to change this website. The familiar 30 score cards, 65 word cards and 30 shopping bills are embedded in the walkthroughs so you can learn directly on the page.
| Source | Coverage in these lessons |
|---|---|
| Lecture 4.1 | Nested birthday search, self-pairs, repeated pairs, early stop, pair-count growth |
| Lecture 4.2 | Month bins, safe exclusions, day bins and within-bin scans |
| Lecture 4.3 | Exact pair formula, equal-size and unequal-size bin work, crowded bins |
| Lecture 4.4 | Loyalty definition, customer groups, avoiding repeated scans, time and space |
| Lecture 4.5 | Total bands, strength groups, candidate pairs, heuristic limits and adaptive bins |
| Lecture 4.6 | SearchBirthday parameters, Boolean return, marked processed cards, side-effect contracts |
| Lecture 4.7 | Backward pronoun search, restoration, LastName memory and counterexamples |
| Lecture 4.8 | Types, records/lists, flowcharts, assignments, filtering, accumulators, procedures and pass patterns |
| Tutorial 4.1 | OR overlap, independent IFs and separate noun/verb counters |
| Tutorial 4.2 | City AND Maths equality, three tables, 435 versus 55 comparisons |
| Tutorial 4.3 | Vowel/consonant procedure, IF/ELSE, 1-based index, termination and two returns |
The lecture conversations include rough estimates and spoken arithmetic corrections. These notes use exact distinct unordered pair counts: 435 for 30 cards, 28 for 8 cards and 49,995,000 for 10,000 cards. Pair comparisons are reported separately from grouping visits. Birthday month spellings Jul and July are normalized. Under that convention the actual month bins require 30 pair checks.
The study-partner band endpoints here are explicit and non-overlapping. Candidate enumeration includes all students rather than setting aside high scorers, and it is not an exclusive team assignment. The pronoun explorer labels nearest-name output as a heuristic candidate and separately shows the meaning in the passage. Its explicit name list cannot detect every person role.
The vowel/consonant tutorial is traced exactly for reluctant (3, 6). Additional word choices use a documented letters-only, five-vowel convention. Course label names and record identifiers are retained. These decisions make extensions and source conventions visible instead of silently changing the task.