| Number | Date | Topics Covered | Notes and Readings | |
|---|---|---|---|---|
| 01 | 25 Aug | Introduction | lecture 01 | |
| 02 | 27 Aug | Functions and Patterns | lecture 02 | |
| 03 | 01 Sep | Induction and Recursion | lecture 03 | |
| 04 | 03 Sep | Lists and Structural Induction | lecture 04 | |
| 05 | 08 Sep | Datatypes I | lecture 05 | |
| 06 | 10 Sep | Datatypes II and Introduction to Cost Analysis | lecture 06 | |
| 07 | 15 Sep | Cost Analysis: Introduction | lecture 07 | |
| 08 | 17 Sep | Cost Analysis: Sorting | lecture 08 | |
| 09 | 22 Sep | Polymorphism | lecture 09 | |
| 24 Sep | MIDTERM EXAM #1 | |||
| 10 | 29 Sep | Higher-Order Functions I | lecture 10 | 11 | 01 Oct | Higher-Order Functions II | lecture 11 |
| 12 | 06 Oct | Higher-Order Functions III | lecture 12 | |
| 13 | 08 Oct | Exceptions | lecture 13 | |
| 13 Oct | FALL BREAK | |||
| 15 Oct | FALL BREAK | |||
| 14 | 20 Oct | Regular Expressions I | lecture 14 | |
| 15 | 22 Oct | Regular Expressions II | lecture 15 | |
| 16 | 27 Oct | Modules I: Signatures and Structures | lecture 16 | |
| 17 | 29 Oct | Modules II: Functors | lecture 17 | |
| 03 Nov | DEMOCRACY DAY | |||
| 05 Nov | MIDTERM EXAM #2 | |||
| 18 | 10 Nov | Parallelism and Sequences | ||
| 19 | 12 Nov | Modules III: Red-Black Trees | ||
| 20 | 17 Nov | Lazy Programming | ||
| 21 | 19 Nov | Imperative Programming | ||
| 22 | 24 Nov | TBD | ||
| 26 Nov | THANKSGIVING BREAK | |||
| 23 | 01 Dec | Games | ||
| 24 | 03 Dec | Review |
The "Notes and Readings" field will usually be blank until it is updated before the given day's lectures (generally by the night before).
Disclaimer: All topics and dates are subject to change.