| Topic |
Source |
Lectures |
| Sequences, limits, rates of growth |
0.3 in [M/R] [Notes 1] |
5 |
| Induction |
2.1-2.3, 2.6, 2.8 in [M/R] |
4 |
| Basic counting, binomial theorem |
4.1-4.6 in [M/R] |
5 |
| Sampling, distributions |
4.7 in [M/R] |
2 |
| Generating functions |
4.8 in [M/R] |
3 |
| Graph theory definitions, isomorphism |
3.1-3.2 in [M/R] |
2 |
| Eulerian cycles, graph coloring, planarity |
3.3, 3.6 in [M/R] |
4 |
| Trees |
3.7 in [M/R] |
2 |
| Hamiltonian cycles, TSP |
3.4 (4.9) in [M/R] |
2 |
| Gaussian eliminaton |
*See note below |
3 |
| Eigenvalues, eigenvectors, Markov chains |
*See note below |
3 |
| Linear functions, linear programming |
[Notes 2], [Notes 3] |
1 |
| Simplex algorithm |
[Notes 2], [Notes 3] |
4 |
| Combinatorial optimization |
[Notes 2], [Notes 4] |
3 |
*See web notes for Math 1502 and/or Math2601.