Dynamic Programming, Greedy Algorithms
Learn basic algorithm design techniques like divide and conquer, dynamic programming, and greedy algorithms in this comprehensive course. Earn academic credit towards CU Boulder’s MS in Data Science or MS in Computer Science degrees. Ideal for recent graduates or working professionals. Enroll now!
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
User Reviews
Be the first to review “Dynamic Programming, Greedy Algorithms”
You must be logged in to post a review.
There are no reviews yet.