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).
About this Course
Skills you will gain
- 5 stars86.51%
- 4 stars11.41%
- 3 stars1.65%
- 2 stars0.16%
- 1 star0.24%
TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.
A very good and challenging course. A great introduction to dynamic programming with many examples to practice and learn multiple programming paradigms.
Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!
About the Algorithms Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.