Algor. Design & Analysis

Building on a first undergraduate course in data structures, this course contains a deeper analysis of the design of efficient algorithms on data structures for problems in sorting, searching, graph theory, combinatorial optimization, computational geometry, and algebraic computation. Topics covered in the course include divide-and-conquer, dynamic programming, greedy method, and approximation algorithms.