Week 1 Lecture slides:

• 17: Two motivating application;
• 18: Introduction to greedy algorithms;
• 19: A scheduling application;
• 20: Prim's MST application.

Week 2 Lecture slides:

• 21: Kruskal’S MST Algorithm;
• 22: Clustering;
• 23: Union-Find(optional).

Week 3 Lecture slides:

• 24: Huffman Code;
• 25: Max weight independent set.

Week 4 Lecture slides:

• 26: Knapsack;
• 27: Sequence alignment;
• 28: Optimal binary search trees.