Events: Fall 2013

Post Date Lecture Topic Assignments/Quiz Associated Files
T: Aug 20 discrete math quiz, start intro: upto halting problem    
R: Aug 22 analysis: upto slide 27 of analysis    
F: Aug 23 (lab): prove p, not p -> x; proof strategies    
T: Aug 27 finish analysis; start sort1: loop invariant    
T: Aug 27 asymptotic notation, asymptotic analysis HW1 HW1
F: Sep 6 Loop invariants, Heapsort HW2 HW2
F: Sep 13 Binomial Heap, Quick Sort HW3 HW3
F: Sep 20 Red Black Tree, Amortized Analysis HW4 HW4
F: Oct 11 Dynamic Programming HW5 HW5
F: Oct 19 Graph HW6 HW6
F: Oct 25 MST HW7 HW7
S: Nov 2 DIJKSTRA-SSSP, Dijkstra's algorithm HW8 HW8
S: Nov 9 NP HW9 HW9
S: Nov 17 NP Problems HW10 HW10
S: Nov 30 HW11 HW11