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).
About this Course
Skills you will gain
- 5 stars85.42%
- 4 stars12.78%
- 3 stars1.15%
- 2 stars0.51%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
unlike previous 3 courses
some of course 4's quiz problems are really difficult and not sure how to approach...
Really happy to finish this specialization and I will still study algorithms in the future.
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
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.
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.