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).
Este curso forma parte de Programa especializado: Algoritmos
Ofrecido Por
Acerca de este Curso
Habilidades que obtendrás
- Data Structure
- Algorithms
- Np-Completeness
- Dynamic Programming
Ofrecido por
Programa - Qué aprenderás en este curso
Week 1
Week 2
Week 3
Week 4
Reseñas
- 5 stars85,47 %
- 4 stars12,73 %
- 3 stars1,14 %
- 2 stars0,50 %
- 1 star0,12 %
Principales reseñas sobre SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
One of the best courses I did on Coursera.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.
Acerca de Programa especializado: Algoritmos

Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Estudiante.