Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)

Course 3 of 4 in the Algorithms Specialization.

Syllabus

WEEK 1

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

WEEK 2

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

WEEK 3

Huffman codes; introduction to dynamic programming.

WEEK 4

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.