| Num | Day | Date | Topics Covered | Materials |
|---|---|---|---|---|
| 1 | Th | 23 Jan | Overview | code |
| 2 | Tu | 28 Jan | Programming Basics | code |
| 3 | Th | 30 Jan | Strings, Loop Invariants | code, notes |
| 4 | Tu | 4 Feb | Contracts | code, reading |
| 5 | Th | 6 Feb | Ints | reading |
| 6 | Tu | 11 Feb | More Ints; Intro to Arrays | code |
| 7 | Th | 13 Feb | Arrays and Contracts | code, reading |
| 8 | Tu | 18 Feb | Linear Search | code, reading |
| 9 | Th | 20 Feb | Binary Search | arrayutil.c0, code, reading |
| 10 | Tu | 25 Feb | Selection Sort | code, reading |
| 11 | Th | 27 Feb | Selection Sort II; Timing | code, reading |
| 12 | Tu | 4 Mar | Asymptotic Analysis | big-O examples, reading |
| 13 | Th | 6 Mar | MIDTERM | |
| 11-20 Mar | No class: spring break! | |||
| 14 | Tu | 25 Mar | Quicksort | code, reading |
| 15 | Th | 27 Mar | Stacks and Queues | code 1, code 2, code 3, reading |
| 16 | Tu | 1 Apr | Pointers and structs | reading (sec 2 and some of 3) |
| 17 | Th | 3 Apr | Linked lists | code, reading |
| 18 | Tu | 8 Apr | Implementing data structures: Stacks and queues II | code, reading |
| 19 | Th | 10 Apr | Unbounded Arrays and Amortized Analysis | heartbleed, reading |
| 20 | Tu | 15 Apr | Unbounded Arrays II; Intro to Hash Tables | reading |
| 21 | Th | 17 Apr | Hash Tables | reading, see HW8 for code |
| 22 | Tu | 22 Apr | Priority Queues | reading, see HW8 for code |
| 23 | Th | 24 Apr | Restoring Invariants | reading, see HW8 for code |
| 24 | Tu | 29 Apr | Graphs I | code |
| 25 | Th | 1 May | Graphs II | code, review slides |
| 26 | Tu | 6 May | HW Office hours | |
| Th | 15 May, 9am-noon, Exley 139 | Final exam |
Note that the schedule is subject to change.