| Date | Topic/Event | Notes |
|---|---|---|
| 6/20 M | Basic counting (5.1), Arrangements vs selections (5.2) | |
| 6/21 T | Arrangements and selections with reptition (5.3) | |
| 6/22 W | Binomial Identities (5.5), Generating function models (6.1) | |
| 6/27 W | Coefficients of generating functions (6.2), Exponential generating functions (6.4) | |
| 6/28 W | Recurrence Relation models (7.1), Linear Recurrence (7.3) | |
| 6/29 W | Inhomogeneous recurrences (7.4), Recurrences and G.F. (7.5) | |
| 6/30 R | Recurrences and G.F. - cont'd (7.5) | |
| 7/5 T | Review | |
| 7/6 W | Midterm | |
| 7/11 M | Set Theory, Inclusion Exclusion Formula (8.1). | |
| 7/12 T | Inclusion Exclusion Formula - cont'd (8.1, 8.2) | |
| 7/13 W | Graphs and Trees (1.1, 3.1) | |
| 7/18 M | Edge Counting (1.3) | |
| 7/19 T | Planar Graphs (1.4), Euler Cycles (2.1) | |
| 7/20 W | Hamiltonian Cycles (2.2), Coloring (2.3) | |
| 7/25 M | Coloring Theorems (2.4), Network flows (4.3) | |
| 7/26 T | Flows (4.3), Matching (4.4) | |
| 7/27 W | Review | |
| 7/28 R | Final |