Course Description for Design and Analysis of Algorithms

Description: This graduate-level course in the design and analysis of algorithms will cover techniques for the design of algorithms and the theory of NP-completeness. The main topics covered in the course include dynamic programming; divide and conquer; union-find data structures; graph algorithms; NP-completeness; and advanced topics.