The Knapsack Problem

Loading...
Visualizar o programa do curso

Habilidades que você aprenderá

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Avaliações

4.8 (1,076 classificações)
  • 5 stars
    87.08%
  • 4 stars
    11.05%
  • 3 stars
    1.58%
  • 2 stars
    0.09%
  • 1 star
    0.18%
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 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 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Ministrado por

  • Placeholder

    Tim Roughgarden

    Professor

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.