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.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
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
unlike previous 3 courses
some of course 4's quiz problems are really difficult and not sure how to approach...
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
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.