Learn more about the Dynamic Programming, Greedy Algorithms course here including a course overview, cost information, related jobs and more.

It 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) .