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...
Compétences que vous apprendrez
Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm
Avis
4.8 (1,184 évaluations)
- 5 stars86,65 %
- 4 stars11,31 %
- 3 stars1,68 %
- 2 stars0,08 %
- 1 star0,25 %
AB
22 avr. 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 févr. 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.
À partir de la leçon
Week 3
Huffman codes; introduction to dynamic programming.
Enseigné par
Tim Roughgarden
Professor
Explorer notre catalogue
Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.
Coursera Footer
© 2022 Coursera Inc. Tous droits réservés.
