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

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 Foundations of Data Structures and Algorithms specialization includes two optional preparation courses and a three-course pathway to earn admission to the Online MS in Computer Science. You must ...