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
About this Course
Skills you will gain
- Data Structure
- Dynamic Programming
Syllabus - What you will learn from this course
- 5 stars85.38%
- 4 stars12.83%
- 3 stars1.14%
- 2 stars0.50%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.
very interesting course in Algorithms Specialization.
It is sufficient to arouse interest in studying advance algorithm.
Thank you for your teaching, Professor Tim.
Really happy to finish this specialization and I will still study algorithms in the future.
Great one for people with advanced understanding! Others will find it slightly hard to follow!
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.