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).
Introduction and Motivation
Loading...
Habilidades que você aprenderá
Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm
Avaliações
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!
24 de Fev 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.
Na lição
Week 3
Huffman codes; introduction to dynamic programming.
Ministrado por
Tim Roughgarden
Professor
Explore nosso catálogo
Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.
Coursera Footer
© 2021 Coursera Inc. Todos os direitos reservados.
