Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...

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

Algorithms and Programming. This information is for the 2019/20 session. ... Incremental and recursive algorithms, Divide-and-Conquer, Greedy algorithms. A few highlight applications: Web search and ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...