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

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

The students are encouraged to think and use their acquired knowledge of algorithms in practical and highly applicable programming exercises. The Dynamic Programming and Optimal Control class focuses ...