| Num | Day | Date | Topics Covered | Materials |
|---|---|---|---|---|
| 1 | Tu | 8 Sep | Parallelism | reading |
| 2 | Th | 10 Sep | Computing by calculation | reading |
| 3 | Tu | 15 Sep | Numbers | reading |
| 4 | Th | 17 Sep | Booleans, Pairs, Let | see Lect 3 notes |
| 5 | Tu | 22 Sep | Lists | reading |
| 6 | Th | 24 Sep | Asymptotic Analysis | reading |
| 7 | Tu | 29 Sep | Sequential Sorting | reading |
| 8 | Th | 1 Oct | Divide and Conquer | reading |
| 9 | Tu | 6 Oct | Trees | reading |
| 10 | Th | 8 Oct | Parallel Sorting | reading |
| 11 | Tu | 13 Oct | Polymorphism, Datatypes | reading |
| 12 | Th | 15 Oct | MIDTERM | |
| 13 | Tu | 20 Oct | Higher-order Functions I | reading |
| 14 | Th | 22 Oct | Higher-order Functions II | reading |
| Tu | 27 Oct | Fall Break | ||
| 15 | Th | 29 Oct | Sequences | reading |
| 16 | Tu | 3 Nov | Sequences II | reading |
| 17 | Th | 5 Nov | N-body simulation | reading |
| 18 | Tu | 10 Nov | Modules I: Signatures, Structures | code, reading |
| 19 | Th | 12 Nov | Modules II; Options | reading |
| 20 | Tu | 17 Nov | Modules III: Functors | reading |
| 21 | Th | 19 Nov | Modules Review/Type Classes | reading |
| 22 | Tu | 24 Nov | Data Extraction | see HW handout |
| Th | 26 Nov | Thanksgiving | ||
| 23 | Tu | 1 Dec | Machine Learning | see HW handout |
| 24 | Th | 3 Dec | Scheduling | reading |
| 25 | Tu | 8 Dec | Parallelism and Effects | reading |
| 26 | Th | 10 Dec | Two kinds of beauty | slides |
| Sat | 19 Dec, 9am, Exley 109 | FINAL EXAM |
Note that the schedule is subject to change.