Algorithm Design and Analysis

Catalog description

This course covers fundamental tools and techniques in computer science for designing and analyzing algorithms. Specific algorithms covered include: divide and conquer, backtracking, dynamic programming, and greedy algorithms. Graph algorithms including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths are also covered. Algorithmic complexity is analyzed both theoretically and practically using state-of-the-art benchmarking tools.