This week the lectures have been on Greedy Algorithms. The topics match these book sections:

• Intro, coin changing: Section 7.1
• Continuous knapsack: Section 7.6
• Prim’s MST algorithm: Section 7.3
• Dijkstra’s Shortest Path algorithm: Section 7.4
• Prim’s MST algorithm: Section 7.2 (we’ll talk about this on 4/6). Also, look over Section 3.6, page 150-161.
• Nothing on Section 7.5 (Huffman Encoding -- you did this in CS2150!)
• No book sections cover activity selection