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



Sep 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).


Sep 20, 2021

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


1 - Dynamic Programming, Greedy Algorithms 的 13 个评论(共 13 个)

创建者 Spyros T

Oct 26, 2021

创建者 Dave M

Sep 21, 2021

创建者 Bijan S

Dec 14, 2021

创建者 Rishabh S

Aug 5, 2021

创建者 Yu S

Jul 23, 2022

创建者 Abdikhalyk T

Dec 1, 2021

创建者 Peter D

Apr 3, 2022

创建者 Jeffrey C

May 15, 2022

创建者 Rafael C

Jul 5, 2022

创建者 Billy C

Dec 6, 2022

创建者 Alejandro M

Sep 19, 2022

创建者 Vanshaj A

Nov 19, 2022

创建者 Sandipan D

Nov 27, 2022