The Knapsack Problem

Loading...
Просмотреть программу курса

Получаемые навыки

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Рецензии

4.8 (оценок: 1,111)
  • 5 stars
    87.21%
  • 4 stars
    10.89%
  • 3 stars
    1.53%
  • 2 stars
    0.09%
  • 1 star
    0.27%
AB
22 апр. 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 февр. 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.

Из урока
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Преподаватели

  • Tim Roughgarden

    Professor

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.