Back to Dynamic Programming, Greedy Algorithms
Learner Reviews & Feedback for Dynamic Programming, Greedy Algorithms by University of Colorado Boulder
226 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.
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 academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more:
MS in Data Science: https://www.coursera.org/degrees/master-of-science-data-science-boulder
MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder
Top reviews
DM
Sep 20, 2021
Excellent. This course covers some difficult topics, but the lectures and homework assignments were superb and made them quite approachable.
SD
Oct 17, 2024
Instructor's material was really good and was very effective in communicating the complex topics
Filter by: