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

In this module the student will learn the very basics of algorithms through three examples ... such as querying streaming data and counting. You will complete a programming assignment worth 16% of ...