| Date | Topics | Reading | Due dates and quizzes |
|---|---|---|---|
| January 14 (W) | About the course (Notes) | ||
| January 16 (F) | Propositional logic (Notes) | 1.1, 1.2 | |
| January 19 (M) | Holiday | ||
| January 21 (W) | Propositional logic, continued (Notes) | ||
| January 23 (F) | Propositional logic, continued (Notes) | ||
| January 26 (M) | Predicate logic (Notes) | 1.3, 1.4 | Homework 1 (HTML, PDF, PostScript) |
| January 28 (W) | Predicate logic, continued (Notes) | Quiz 1 | |
| January 30 (F) | Predicate logic, continued (Notes) | ||
| February 2 (M) | Predicate logic, continued (Notes) | ||
| February 4 (W) | Predicate logic, continued; proof techniques (Notes) | 2.1 | |
| February 6 (F) | Proof techniques, continued (Notes) | Homework 2: (HTML, PDF, PostScript) | |
| February 9 (M) | Mathematical induction (Notes) | 2.2, Appendix A | |
| February 11 (W) | Mathematical induction, continued (Notes) | Quiz 2 | |
| February 13 (F) | Proofs of program correctness (Notes) | 1.6, 2.3 | |
| February 16 (M) | No class | Homework 3 (HTML, PDF, PostScript) | |
| February 18 (W) | Proofs of program correctness, continued (Notes) | ||
| February 20 (F) | Proofs of program correctness, continued (Notes) | ||
| February 23 (M) | Recursion and recurrence relations (Notes) | 2.4 | |
| February 25 (W) | Recursion and recurrence relations, continued (Notes) | Quiz 3 | |
| February 27 (F) | Analysis of algorithms (Notes) | 2.5, Appendix B | |
| March 1 (M) | Analysis of algorithms, continued (Notes) | Homework 4 (HTML, PDF, PostScript) | |
| March 3 (W) | Sets (Notes) | 3.1 | |
| March 5 (F) | Review for midterm (Notes) | Homework 5 (HTML, PDF, PostScript), due at class time | |
| March 8 (M) | Midterm exam (review in HTML, PDF, PostScript) | ||
| March 10 (W) | Counting (Notes) | 3.2 | |
| March 12 (F) | More infinite sets, recursion (Notes) | ||
| March 15 - March 19 | Spring break | ||
| March 22 (M) | No class | ||
| March 24 (W) | Counting, continued (Notes) | 3.3 | |
| March 26 (F) | Permutations and combinations (Notes) | 3.4 | |
| March 29 (M) | Permutations and combinations, continued (Notes) | ||
| March 31 (W) | Probability (Notes) | 3.5 | Quiz 4 |
| April 2 (F) | Probability, continued (Notes) | ||
| April 5 (M) | Relations (Notes) | 4.1 | |
| April 7 (W) | Topological sorting (Notes) | 4.2 | Quiz 5; Homework 6 (HTML, PDF, PostScript). |
| April 9 (F) | Holiday | ||
| April 12 (M) | Functions (Notes) | 4.4 | |
| April 14 (W) | Functions, continued (Notes) | ||
| April 16 (F) | No class | ||
| April 19 (M) | Matrices (Notes) | 4.5 | |
| April 21 (W) | Graphs (Notes) | 5.1 | Quiz 6 |
| April 23 (F) | Trees (Notes) | 5.2 | Homework 7 (HTML, PDF, PostScript) |
| April 26 (M) | Huffman encoding (Notes) | 5.4 | |
| April 28 (W) | Review (Notes) | ||
| April 30 (F) | Course wrap-up (Notes) | Homework 8 (HTML, PDF, PostScript) | |
| May 6 (Th) 11:30am | Optional review session | ||
| May 7 (F) 2pm | Final exam (review in HTML, PDF, PostScript) | ||
| May 11 (T) noon | Optional extra-credit homework (HTML, PDF, PostScript) |