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).
A More Complex Example
Loading...
Destrezas que aprenderás
Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm
Reseñas
4.8 (1,197 calificaciones)
- 5 stars86,54 %
- 4 stars11,44 %
- 3 stars1,67 %
- 2 stars0,08 %
- 1 star0,25 %
AB
22 de abr. de 2020
Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!
SW
24 de feb. de 2019
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
De la lección
Week 3
Huffman codes; introduction to dynamic programming.
Impartido por:
Tim Roughgarden
Professor
Explora nuestro catálogo
Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.
Coursera Footer
© 2022 Coursera Inc. Todos los derechos reservados.
