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
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
- 5 stars85.29%
- 4 stars12.90%
- 3 stars1.16%
- 2 stars0.51%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
very interesting course in Algorithms Specialization.
It is sufficient to arouse interest in studying advance algorithm.
Thank you for your teaching, Professor Tim.
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.
Really happy to finish this specialization and I will still study algorithms in the future.
Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!
About the Algorithms Specialization
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
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.