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