Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
By Coursera
on Coursera
· Technology
About This Course
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).
Instructor
Greedy Algorithms
Frequently Asked Questions
How much does Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming cost?
Visit the Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming course page for current pricing and available discounts.
Who teaches Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming?
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming is taught by Tim Roughgarden, Stanford University.
What skill level is Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming for?
This course is designed for advanced learners.