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.
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
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.