The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
This course is part of the Algorithms Specialization
Offered By
About this Course
Skills you will gain
- Data Structure
- Algorithms
- Np-Completeness
- Dynamic Programming
Offered by
Syllabus - What you will learn from this course
Week 1
Week 2
Week 3
Week 4
Reviews
- 5 stars85.47%
- 4 stars12.73%
- 3 stars1.14%
- 2 stars0.50%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
One of the best courses I did on Coursera.
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
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.