Date |
Topics |
Reading |
Due dates and quizzes |
January 16 |
About the course |
|
|
January 21 |
Propositional logic |
1.1, 1.2 |
|
January 23 |
Propositional logic, continued |
|
|
January 28 |
Predicate logic |
1.3, 1.4 |
Homework 1
(HTML,
PDF,
PostScript)
|
January 30 |
Predicate logic, continued |
|
|
February 4 |
Predicate logic, continued; proofs of program correctness |
1.6 |
Quiz 1;
Homework 2
(HTML,
PDF,
PostScript)
|
February 6 |
Proofs of program correctness |
|
|
February 11 |
Proof techniques |
2.1 |
|
February 13 |
Proofs of program correctness and proof techniques, review |
|
Quiz 2;
Homework 3
(HTML,
PDF,
PostScript)
|
February 18 |
No class |
2.2 |
|
February 20 |
Mathematical induction |
|
|
February 25 |
Proofs of program correctness, continued |
2.3 |
Homework 4
(HTML,
PDF,
PostScript)
|
February 27 |
Proofs of program correctness, continued;
review for midterm |
|
Quiz 3;
Homework 5
(HTML,
PDF,
PostScript --
really due March 3 at noon)
|
March 4 |
Midterm exam
(Review)
|
|
|
March 6 |
Recursion |
2.4 |
|
March 18 |
Recursion, continued; recurrence relations |
|
|
March 20 |
Recurrence relations, continued;
analysis of algorithms |
2.5, Appendix A, Appendix B |
|
March 25 |
Analysis of algorithms, continued |
|
Homework 6
(HTML,
PDF,
PostScript)
|
March 27 |
Sets |
3.1 |
Quiz 4
|
April 1 |
No class |
|
|
April 3 |
Counting |
3.2, 3.3 |
Homework 7
(HTML,
PDF,
PostScript)
|
April 8 |
Permutations and combinations |
3.4 |
|
April 10 |
Relations |
4.1 |
Quiz 5
|
April 15 |
Relations, continued; topological sorting |
4.2 |
Homework 8
(HTML,
PDF,
PostScript)
|
April 17 |
Functions |
4.4 |
|
April 22 |
Functions, continued; matrices |
4.5 |
|
April 24 |
Graphs and trees |
5.1, 5.2 |
Quiz 6
|
April 29 |
Graphs and trees, continued |
|
Homework 9
(HTML,
PDF,
PostScript)
|
May 1 |
Course wrap-up |
|
Homework 10
(HTML,
PDF,
PostScript) --
not for credit
|
May 12 (2pm) |
Final exam
(Review)
|
|
Homework X
(HTML,
PDF,
PostScript) --
optional, for extra credit
|