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

It covers basic algorithm design techniques such as divide and conquer, dynamic ... a programming assignment that will help you approach the development of algorithms related to what we study in this ...

Programming Background: The course involves solving programming assignments in Python. You must be comfortable with Python programming. This includes basic control structures in Python: conditional ...