Here is this semester's tentative schedule; I will update it as the semester progresses.
Please note that lecture notes are provided as a supplement, and are NOT a substitute for attending lecture. In particular, these are not guaranteed, so expect technical difficulties to prevent them from being posted at least a few times in the semester; they also will not contain exercises whose solutions are worked out on the board in class. Please plan accordingly to either take notes or get them from a friend if necessary.
Date Topic Reading Lecture Notes Extra links (if any) Tuesday Jan. 13 Class canceled See Panapto vido on Canvas Thursday Jan. 15 Introduction and review of prereqs Chapter 0 of Algorithms, by Jeff Erickson Lecture Notes More on induction
Even more on inductionTuesday Jan. 20 Recursion and recurrences Chapter 1 of Algorithms, by Jeff Erickson Lecture Notes Solving recurrences Thursday Jan. 22 Backtracking and Dynamic Programming Chapter 2 of Algorithms, by Jeff Erickson Lecture Notes Tuesday Jan. 27 Dynamic Programming Chapter 3 of Algorithms, by Jeff Erickson Lecture Notes Thursday Jan. 29 Dynamic Programming Chapter 3 of Algorithms, by Jeff Erickson Lecture Notes Tuesday Feb. 3 Approximation Algorithms Section 6 from Supplemental notes Lecture Notes Thursday Feb. 5 Greed and approximation Section 7 from Supplemental notes Tuesday Feb. 10 Thursday Feb. 12 Tuesday Feb. 17 Thursday Feb. 19 Tuesday Feb. 24 Thursday Feb. 26 Tuesday March 3 Midterm exam in class (tentative) Thursday March 5