Chevron Left
Zurück zu Dynamic Programming, Greedy Algorithms

Bewertung und Feedback des Lernenden für Dynamic Programming, Greedy Algorithms von University of Colorado Boulder

43 Bewertungen

Über den Kurs

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

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

Filtern nach:

1 - 12 von 12 Bewertungen für Dynamic Programming, Greedy Algorithms

von Spyros T

26. Okt. 2021

von Dave M

21. Sep. 2021

von Bijan S

14. Dez. 2021

von Rishabh S

5. Aug. 2021

von Yu S

23. Juli 2022

von Abdikhalyk T

1. Dez. 2021

von Peter D

3. Apr. 2022

von Jeffrey C

15. Mai 2022

von Rafael C

5. Juli 2022

von Alejandro M

19. Sep. 2022

von Vanshaj A

19. Nov. 2022

von Sandipan D

27. Nov. 2022