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
I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!
Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
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.