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).
À propos de ce cours
Compétences que vous acquerrez
Université de Stanford
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,11 %
- 4 stars13,05 %
- 3 stars1,17 %
- 2 stars0,52 %
- 1 star0,13 %
Meilleurs avis pour SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Really happy to finish this specialization and I will still study algorithms in the future.
unlike previous 3 courses some of course 4's quiz problems are really difficult and not sure how to approach...
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
À propos du Spécialisation Algorithmes
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.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.