Chevron Left
Back to Dynamic Programming, Greedy Algorithms

Learner Reviews & Feedback for Dynamic Programming, Greedy Algorithms by University of Colorado Boulder

32 ratings

About the Course

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

Top reviews


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.

Filter by:

1 - 10 of 10 Reviews for Dynamic Programming, Greedy Algorithms

By Spyros T

Oct 26, 2021

By Dave M

Sep 21, 2021

By Bijan S

Dec 14, 2021

By Rishabh S

Aug 5, 2021

By Yu S

Jul 23, 2022

By Abdikhalyk T

Dec 1, 2021

By Peter D

Apr 3, 2022

By Jeffrey C

May 15, 2022

By Rafael C

Jul 5, 2022

By Alejandro M

Sep 19, 2022