| Section | Topic | Class date |
|---|---|---|
| 3.1 | Algorithm | Aug 29 |
| 3.2 | Growth of Functions | Aug 31 |
| 3.3 | Complexity of Algorithms | Sep 5 |
| 3.3 | Complexity of Algorithms | Sep 7 |
| 5.1 | Mathematical Induction | Sep 12 |
| 5.2 | Strong Induction | Sep 14 |
| 5.3 | Recursive Definition | Sep 19 |
| 5.4 | Recursive Algorithms | Sep 21 |
| 10.1, 10.2 | Intro to Graphs | Sep 26 |
| 10.3 | Representing Graphs | Sep 28 |
| 10.4 | Connectivity | Oct 3 |
| 10.6 | Shortest Path | Oct 5 |
| 10.5 | Euler and Hamilton Paths | Oct 10 |
| Review: Practice questions | Oct 12 | |
| Review for Midterm | Oct 17 | |
| 1.1-1.2 | Systems of Linear Equations | Oct 19 |
| Midterm Exam (during recitation) | Oct 20 | |
| 1.3-1.4 | Systems of Linear Equations | Oct. 24 |
| Midterm Exam discussion | Oct. 26 | |
| 2.1-2.4 | Matrix Arithmetic | Oct. 31 |
| 2.4-2.7 | Matrix Arithmetic | Nov 2 |
| 3.1-3.4 | Operations on Matrices | Nov 7 |
| 4.1-4.2 | Eigenvalues and Eigenvectors | Nov 9 |
| 4.2 | Eigenvalues and Eigenvectors, EigenEx | Nov. 14 |
| 5.1-5.2 | Graphical Explorations of Vectors | Nov. 16 |
| PageRank notes, Google PageRank | Nov 28 | |
| PageRank notes, Google PageRank | Nov 30 | |
| Review: Practice questions | Dec. 5 | |
| Review | Dec. 7 | |
| Final Exam 10:30 - 12:30 in TL302 | Dec. 19 |