| Section | Topic | Class date |
|---|---|---|
| 3.1 | Algorithm | Jan. 11 |
| 3.2 | Growth of Functions | Jan. 13 |
| 3.3 | Complexity of Algorithms | Jan. 18 |
| 3.3 | Complexity of Algorithms | Jan. 20 |
| 5.1 | Mathematical Induction | Jan. 25 |
| 5.2 | Strong Induction | Jan. 27 |
| 5.3 | Recursive Definition | Feb. 1 |
| 5.4 | Recursive Algorithms | Feb. 3 |
| 10.1, 10.2 | Intro to Graphs | Feb. 8 |
| 10.3 | Representing Graphs | Feb. 10 |
| 10.4 | Connectivity | Feb. 15 |
| 10.6 | Shortest Path | Feb. 17 |
| Review: Practice questions | Feb. 22 | |
| Review for Midterm | Feb. 24 | |
| Midterm Exam (during recitation) | Feb. 25 | |
| 10.5 | Euler and Hamilton Paths | Mar. 8 |
| Midterm Exam discussion | Mar. 10 | |
| 1.1-1.2 | Systems of Linear Equations | Mar. 15 |
| 1.3-1.4 | Systems of Linear Equations | Mar. 17 |
| 2.1-2.4 | Matrix Arithmetic | Mar. 22 |
| 2.4-2.7 | Matrix Arithmetic | Mar. 24 |
| 3.1-3.4 | Operations on Matrices | Mar. 29 |
| 4.1-4.2 | Eigenvalues and Eigenvectors | Mar. 31 |
| 4.2 | Eigenvalues and Eigenvectors, EigenEx | Apr. 5 |
| 5.1-5.2 | Graphical Explorations of Vectors | Apr. 7 |
| PageRank notes, Google PageRank | Apr. 12 | |
| PageRank notes, Google PageRank | Apr. 14 | |
| Review: Practice questions | Apr. 19 | |
| Review | Apr. 21 | |
| 5.1-5.2 | Final Exam 10:30 - 12:30 | May. 3 |