6.046 Fall 2004 Section Notes

Sections A (Friday 11:00a, 36-112) and B (Friday 12:00p, 36-112)
David Liben-Nowell

• 10 September 2004: Introduction, Logistics, and Proofs of Correctness [notes]
• 17 September 2004: Solving Recurrences, Master Method, Sloppiness [notes]
• 24 September 2004: Some Probability Review, Heaps, and Heapsort [notes] [Dexter Kozen on proofs]
• 1 October 2004: Quiz 1 Review [notes] [PS2 comments] [Bill's page with master method problems]
• 8 October 2004: Binary Search Trees [notes]
• 15 October 2004: Augmenting Data Structures [notes]
• 22 October 2004: Competitive Analysis [notes] [PS3 comments]
• 29 October 2004: Greedy Algorithms and Dynamic Programming [notes] [PS4 comments]
• 5 November 2004: DFS and Applications (with bonus graph algorithms review in the notes) [notes]
• 12 November 2004: Convex Hull [notes]
• 3 December 2004: Max Flow, String Matching, Tintinnabulation [notes]