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