Back to Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University
1,272 ratings
About the 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).
Top reviews
AZ
Mar 10, 2020
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
YA
Feb 3, 2021
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
Filter by: