CS573 - Algorithms - Fall 2012

Schedule and Lecture Notes


This is a tentative course outline. Lecture topics are subject to change. Exam dates are not.
The class notes in one big file. (Class notes are going to be updated during the semester.)
Tue 8/28 1: NP Completeness I
Thu 8/30 2: NP Completeness II
Tue 9/4 3: NP Completeness III
Thu 9/6 4: Dynamic Programming
Tue 9/11 5: Even MORE Dynamic Programming
Thu 9/13 6: Approximation algs I
Tue 9/18 7: Approximation algs II
Thu 9/20 8: Approximation algs III
Tue 9/25 9: Randomized Algorithms I
Thu 9/27 10: Randomized Algorithms II
Tue 10/2 11: Rand Alg III - Min Cut
Thu 10/4 12: Network Flow I
Tue 10/9 Midterm - Transportation Building 114, 7-9pm
Thu 10/11 13: Network Flow II
Tue 10/16 14: Network Flow III
Thu 10/18 15: Network Flow IV
Thu 10/19 Drop deadline
Tue 10/23 16: Mincost flow
Thu 10/25 17: Mincost flow II
Tue 10/30 18: Fast Fourier Transform
Thu 11/1 19: Sorting Networks
Tue 11/6 20: Linear Programming
Thu 11/8 21: Linear Programming II
Tue 11/13 22: Linear Programming III
Thu 11/15 23: Max cut
Tue 11/20 Thanksgiving Vacation
Thu 11/22 Thanksgiving Vacation
Tue 11/27 24: Huffman coding,
Thu 11/29 25: Entropy II,
Tue 12/4 26: Entropy III, Shannon's theorem
Thu 12/6 27: Union find
Tue 12/11 28: Learning
Tue 12/17 Final: exam 7-10 PM, Monday, Dec. 17

Last modified: Tue Dec 11 11:15:04 CST 2012