| Section | Topic | Class date |
|---|---|---|
| 3.1 | Algorithm | Jan. 19 |
| 3.2 | Growth of Functions | Jan. 21 |
| 3.3 | Complexity of Algorithms | Jan. 26 |
| 3.3 | Complexity of Algorithms | Jan. 28 |
| 5.1 | Mathematical Induction | Feb. 2 |
| 5.2 | Strong Induction | Feb. 4 |
| 5.3 | Recursive Definition | Feb. 9 |
| 5.4 | Recursive Algorithms | Feb. 11 |
| 10.3 | Representing Graphs | Feb. 16 |
| 10.4 | Connectivity | Feb. 18 |
| 10.5 | Euler and Hamilton Paths (free day) | Feb. 23 |
| 10.6 | Shortest Path | Feb. 25 |
| Review: Practice questions | Mar. 2 | |
| 10.7 | Planar Graphs (skip) | Mar. 4 |
| Midterm Exam (during recitation) | Mar. 5 | |
| Midterm Exam discussion | Mar. 9 | |
| 10.8 | Graph Coloring (skip), 10.5 | Mar. 11 |
| 1.1-1.2 | Systems of Linear Equations | Mar. 15 |
| 1.3-1.4 | Systems of Linear Equations | Mar. 18 |
| 2.1-2.4 | Matrix Arithmetic | Mar.23 |
| 2.4-2.7 | Matrix Arithmetic | Mar. 25 |
| 3.1-3.4 | Operations on Matrices | Mar. 30 |
| 4.1-4.2 | Eigenvalues and Eigenvectors | Apr. 1 |
| 4.2 | Eigenvalues and Eigenvectors, EigenEx | Apr. 6 |
| 5.1-5.2 | Graphical Explorations of Vectors | Apr. 8 |
| 5.1-5.2 | Graphical Explorations of Vectors | Apr. 13 |
| PageRank notes, Google PageRank | Apr. 15 | |
| Review: Practice questions | Apr. 20 | |
| Review | Apr. 22 | |
| 5.1-5.2 | Final Exam 10:30 - 12:30 | May 4 |