Lectures -

• administrative (PDF) (6-up PDF)

The following are textbook slides (in 4-up PDF format) for this semester.

• ch 1 - some representative problems (PDF)
• ch 2 - basics of algorithm analysis (PDF)
• ch 3 - graphs (PDF)
• ch 4 - greedy algorithms (part 1) (PDF)
• ch 4 - greedy algorithms (part 2) (PDF)
• ch 5 - divide and conquer (part 1) (PDF)
• ch 5 - divide and conquer (part 2) (PDF)
• ch 6 - dynamic programming (part 1) (PDF)
• ch 6 - dynamic programming (part 2) (PDF)
• ch 7 - network flow (part 1) (PDF)
• ch 7 - network flow (part 2) (PDF)
• ch 7 - network flow (part 3) (PDF)
• ch 8 - NP and computational intractability (part 1) (PDF)
• ch 8 - NP and computational intractability (part 2) (PDF)
• ch 8 - NP and computational intractability (part 3) (PDF)

• review (courtesy of Abhishek Sharma) (PDF)
• data structures for stable matching problem (courtesy of Abhishek Sharma) (PDF)