It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms ... The exam is open book and notes. You may access your own notes and any resources ...

The class notes provided are rigorous and clear and are appreciated by the students. Some of the concepts covered are hard/impossible to find in the literature, e.g. rigorous but accessible proof of ...

This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...