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).
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University
via Coursera
Instructor(s)
Tim Roughgarden
Stanford University
via Coursera
Free (audit)
English
Paid Certificate Available
Approx. 15 hours to complete
Self paced
Intermediate Level
Subtitles: Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish