Math 113 F99 B.
Let's number the weeks 0,...,10, so that the first class is 0-F.
| day | section | topics |
| 0-F | 2.1-3, 2.5 | Product, sum rules; permutations |
1-M |
2.6-8, 2.15 | Subsets, combinations, binomial coefficients |
| 1-W | 2.9-10 | Probability, sampling with replacement |
| 1-F | 2.11 | Occupancy problems |
2-M |
3.1 | Fundamental concepts of graph theory |
| 2-W | 3.2 | Connectedness |
| 2-F | 3.3 | Graph Coloring |
3-M |
3.5 | Trees |
| 3-W | 3.6 | Applications to searching and sorting |
| 3-F | 4.1 | Generating functions |
4-M |
4.2, 4.3.1 | Operating on generating functions; sampling |
| 4-W | Leeway/review | |
| 4-F | Midterm #1 | |
5-M |
4.3.2, 4.4 | Occupancy problems; binomial theorem |
| 5-W | 4.5 | Exponential generating functions; permutations |
| 5-F | 5.1 | Recurrence relations |
6-M |
more on 5.1 | |
| 6-W | 5.2 | The method of characteristic roots |
| 6-F | 5.3 | Solving recurrences using generating functions |
7-M |
5.4.1, 5.5 | Counting trees; divide-and-conquer |
| 7-W | 6.1 | Inclusion/exclusion |
| 7-F | Leeway/review | |
8-M |
Midterm #2 | |
| 8-W | more on 6.1 | |
| 8-F | (Holiday) | |
9-M |
6.2 | Number of objects with n properties |
| 9-W | 11.1 | Depth-first search; connectedness |
| 9-F | 11.2 | One-way street problem |
10-M |
11.3-4 | Eulerian chains and paths; postman problem |
| 10-W | 11.5, 11.6.1 | Hamiltonian chains and path's; Rédei's theorem |