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