The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
Este curso forma parte de Programa especializado: Algoritmos
ofrecido por
Acerca de este Curso
Habilidades que obtendrás
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
ofrecido por

Universidad 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.
Programa - Qué aprenderás en este curso
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
Week 3
Huffman codes; introduction to dynamic programming.
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
Reseñas
- 5 stars86,47 %
- 4 stars11,51 %
- 3 stars1,66 %
- 2 stars0,08 %
- 1 star0,25 %
Principales reseñas sobre GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
A very good and challenging course. A great introduction to dynamic programming with many examples to practice and learn multiple programming paradigms.
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.
Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!
Acerca de Programa especializado: Algoritmos
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.

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 Alumno.