Dynamic Programming, Greedy Algorithms



Dynamic Programming, Greedy Algorithms

Dynamic Programming, Greedy Algorithms


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 …

Duration Course 3 of 3 in the
Start your Free Trial

Self paced

5,171 already enrolled

4.4stars Rating out of 5 (31 ratings in Coursera)

Go to the Course
We have partnered with providers to bring you collection of courses, When you buy through links on our site, we may earn an affiliate commission from provider.