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).
This course is part of the Algorithms Specialization
Offered By
About this Course
Skills you will gain
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
Offered by
Syllabus - What you will learn from this course
Week 1
Week 2
Week 3
Week 4
Reviews
- 5 stars86.44%
- 4 stars11.50%
- 3 stars1.64%
- 2 stars0.16%
- 1 star0.24%
TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
Great learning experience!!!
I love dynamic p the most.
Assignment 4 is so challenging that it takes me a week to finish the program and debug it!!!
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.
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.
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.