Understand the various algorithms for solving a dynamic program Topics Introduction to dynamic programming Value and policy iterations Stochastic gradient algorithm Q-learning and temporal differences ...

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