CMSC 27200
Theory of AlgorithmsPrerequisites: CMSC 27100 or consent of instructor.
Catalog Description: This course covers design and analysis of efficient algorithms, with emphasis on ideas rather than on implementation. Algorithmic questions include sorting and searching, discrete optimization, algorithmic graph theory, algorithmic number theory, and cryptography. Design techniques include "divide-and-conquer" methods, dynamic programming, greedy algorithms, and graph search, as well as the design of efficient data structures. Methods of algorithm analysis include asymptotic notation, evaluation of recurrent inequalities, the concepts of polynomial-time algorithms, and NP-completeness.
Instructors: P. FelzenszwalbQuarter offered: Winter
Last Verified by Sharon Salveter on 8 April, 2003.