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