Lecture Schedule (Approximate)
Week Date Topic
1 01/15, 01/17 Time Efficiency, Asymptotic Notation, Programming techniques review
2 01/22, 01/24 Algorithm on numbers, Divide and Conquer
3 01/29, 01/31 Divide and Conquer
4 02/05, 02/07 Decompositions of Graph
5 02/12, 02/14 Paths in Graphs
6 02/19, 02/21 Exhaustive Search
7 02/26, 02/27 Midterm Exam and Review
8 03/05, 03/07 Spring Break, Relax
9 03/12, 03/14 Greedy Algorithms
10 03/19, 03/21 Greedy algorithms
11 03/26, 03/28 Dynamic Programming
12 04/02, 04/04 Dynamic Programming
13 04/09, 04/11 Second Midterm, Linear Programming
14 04/16, 04/18 Linear Programming
15 04/23, 04/25 Applications
16 04/30, 05/02 Applications, Course review
17 05/13 (12:30pm) Final Exam