Graduate Algorithm Design and Analysis ((3))

Catalog description

This is an advanced graduate course in the analysis of algorithms, in terms of time and space complexity for best/average/worst case execution using asymptotic notation; the application of standard algorithmic approaches, including divide-and-conquer, greedy algorithms, dynamic programming, and graph algorithms, to algorithm design. Each week lecture meets for 150 minutes. Prerequisite: Classified graduate student status or permission of the instructor.