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
Programa - Qué aprenderás en este curso
Week 1
Week 2
Week 3
Week 4
Reseñas
- 5 stars86,41 %
- 4 stars11,52 %
- 3 stars1,64 %
- 2 stars0,16 %
- 1 star0,24 %
Principales reseñas sobre GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
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!
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
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.