Tentative Course Schedule (subject to change)

   
   Week    Lecture Reading Assignment
#01: Aug 27 Syllabus, Introduction, Stable Marriage 1.1  
#02: Sep 03 Sep 04: Labor Day (No Class)
Stable Marriage, Complexity, Undirected graph traversal
2.1, 2.2, 3.1 1 out
#03: Sep 10 Undirected graph traversal, Directed graph traversal 3.2, 3.3, 3.4, 3.5, 3.6 1 in/2 out
#04: Sep 17 Greedy algorithms 4.1, 4.2, 4.4 2 in/3 out
#05: Sep 24 Minimum Spanning Trees, Kruskal's MST algorithm, Introduction to Divide and Conquer 4.5 3 in
#06: Oct 01 Test 1 will be on Mon, Oct 2, Divide and Conquer and Recurrence Relations covers all course material up to Oct 2  
#07: Oct 08 Merge Sort, Recurrence relations: unrolling, Master method, Closest pair of points
Dynamic programming: Weighted interval scheduling, Memoization,
subset sum, sequence alignment
5.1, notes1, 5.4, 6.1, 6.2, 6.4, 6.6 4 out
#08: Oct 15 Bellman-Ford shortest paths algorithm, Ford-Fulkerson maximum-flow algorithm 6.8. 7.1 4 in/5 out
#09: Oct 22 Max-flow min-cut theorem 7.2, 7.7, 7.9 5 in/6 out
#10: Oct 29 NP, NP-Completeness 8.1, 8.2, 8.3 6 in
#11: Nov 05 Test 2 will be on Mon, Nov 06 covers all course material from Oct 04 to Nov 01  
#12: Nov 12 NP-Completeness 8.4 7 out
#13: Nov 19 Graph coloring, PSPACE and PSPACE-completeness, Undecidability
Nov 22: Thanksgiving (No Class)
8.7, 9.1, 9.2, notes2 7 in/8 out
#14: Nov 26 Halting problem, Approximation algorithms notes2, 11.1, 11.3, 8 in/9 out
#15: Dec 03 Approximation algorithms, Randomized algorithms,
Randomized selection and sorting
11.4, 11.6, 13.3, 13.5 9 in
#16: Dec 10 Test 3 will be on Mon, Dec 11 covers all course material from Nov 06 onward  

1The discussion about master method for solving recurrences is from Introduction to Algorithms, third edition by Cormen et al, Section 4.5 pp 93-96.
2The discussion about Turing machine (undecidability and halting problem) is from Introduction to theory of computation by Michael Sipser, second edition, parts of ch3 and ch4.