Learner Reviews & Feedback for Dynamic Programming, Greedy Algorithms by University of Colorado Boulder
About the Course
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. This course can be taken for academic credit as part of CU Boulder’s MS in Data
Science or MS in Computer Science degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses,
short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not acad...
Top reviews
BC
Dec 7, 2022
This course save me time on learning the dynamic programming. I really love the 4-steps to construct the dynamic programming. It gives me the guideline when designing DP solution.
AM
Sep 19, 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).
51 - 60 of 60 Reviews for Dynamic Programming, Greedy Algorithms
By Andrei B
•Nov 6, 2024
Awesome brain refresher even for those who way past their college years. Highly recommended.
By Jaideep Y
•May 29, 2024
it was an outstanding course
By Guddu K D
•Apr 12, 2024
thank you sir
By Saket M
•Mar 20, 2025
nice
By Chaudhary D D K
•Sep 22, 2024
Good
By Pious S M
•May 29, 2024
Good
By KALAVALA D
•Apr 11, 2025
,MN
By JARUGULLA R
•Oct 25, 2023
Most of the code is found on internet so try to give hard questions which are not found in Internet........thank you
By DESU K
•Nov 8, 2024
Not getting certificate
By Parmesh G
•Jan 25, 2025
How should i get certificate to this course??