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