TechnologyAdvanced
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic...
By Tim Roughgarden on Coursera
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).
Topics Covered
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.
Similar Courses
Technology
HTML & CSS Coding for Beginners: Build your own portfolio!
Chris Dixon
4.8
(24)Included with membershipSkillshare
Technology
Maya for Beginners: Animation
Lucas Ridley
4.6
(46)Included with membershipSkillshare
Technology
JavaScript for Beginners (includes 6+ real life projects)
Kalob Taulien
4.5
(181)Included with membershipSkillshare
Technology
Beginner Bootstrap 4: Hand code beautiful responsive websites fast
Chris Dixon
4.5
(26)Included with membershipSkillshare
Included with membership
Enroll Now