Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Por: Coursera . en: , ,


The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).


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.