| Date | Topic |
|---|---|
| January 9 | Sets and statements |
| January 11 | Symbolic statements |
| January 16 | Conditional connectives |
| January 18 | Boolean algebra |
| January 23 | Truth & equivalence |
| January 25 | Proofs |
| January 30 | Predicate logic |
| February 1 | Relations |
| February 6 | Test #1 |
| February 8 | Equivalence & partial ordering |
| February 13 | Functions & sequences |
| February 15 | Graphs, operations & growth rates |
| February 20 | Mathematical induction |
| February 22 | Recursive algorithms |
| February 27 | Counting principles |
| March 1 | Counting equivalence classes |
| March 6 | Recurrence equations |
| March 8 | First order recurrences |
| March 13 | Spring break |
| March 15 | Spring break |
| March 20 | Test #2 |
| March 22 | Second order recurrences |
| March 27 | Trees & spanning trees |
| March 29 | Rooted trees |
| April 3 | Trees in computing |
| April 5 | Two-three trees |
| April 10 | Total cost in spanning trees |
| April 12 | Graphs |
| April 17 | Tours |
| April 19 | Digraphs & machines |
| April 24 | Test #3 |
| April 26 | Review & test evaluation |