CMSC 37000
AlgorithmsPrerequisites: CMSC 27200 or consent of instructor
Catalog Description: 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, 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: L. BabaiQuarter offered: Winter
Last Verified by Sharon Salveter on 8 April, 2003.