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).

Loading...

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).

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

4.8 (792 ratings)

- 5 stars687 ratings
- 4 stars90 ratings
- 3 stars13 ratings
- 1 star2 ratings

Oct 20, 2018

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

Feb 09, 2017

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!

From the lesson

Week 2

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

#### Tim Roughgarden

Professor

Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.