Chevron Left
Вернуться к Dynamic Programming, Greedy Algorithms

Отзывы учащихся о курсе Dynamic Programming, Greedy Algorithms от партнера Колорадский университет в Боулдере

Оценки: 43

О курсе

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures. Dynamic Programming, Greedy Algorithms can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at

Лучшие рецензии


18 сент. 2022 г.

Great work from professor Sriram Sankaranarayanan explaining such complex material. I wish we could review more examples during the class (specially Dynamic Programming ones).


20 сент. 2021 г.

Excellent. This course covers some difficult topics, but the lectures and homework assignments were superb and made them quite approachable.

Фильтр по:

1–13 из 13 отзывов о курсе Dynamic Programming, Greedy Algorithms

автор: Spyros T

26 окт. 2021 г.

автор: Dave M

21 сент. 2021 г.

автор: Bijan S

14 дек. 2021 г.

автор: Rishabh S

5 авг. 2021 г.

автор: Yu S

23 июля 2022 г.

автор: Abdikhalyk T

1 дек. 2021 г.

автор: Peter D

3 апр. 2022 г.

автор: Jeffrey C

15 мая 2022 г.

автор: Rafael C

5 июля 2022 г.

автор: Billy C

6 дек. 2022 г.

автор: Alejandro M

19 сент. 2022 г.

автор: Vanshaj A

19 нояб. 2022 г.

автор: Sandipan D

27 нояб. 2022 г.