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