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