COE752 Design and Analysis of Algorithms (Last offered: Fall 2011)

[3–0, 3 cr.]

This course covers the time and space complexity of algorithms. It looks at the models of computation, the techniques for efficient algorithm design, and the effect of data structure choice on the efficiency of an algorithm, as well as the divide and conquer techniques, greedy methods, dynamic programming, amortized analysis, graph and network algorithms, NP-completeness, and selected advanced algorithms.

Prerequisite: The consent of the Instructor.

Note: This course has been unavailable since 2014–2015.