CMSC 142
Design & Analysis of Algorithms
Algorithm design techniques: use of data structures, divide & conquer,
dynamic programming, greedy techniques, local & global search. Complexity analysis of algorithms; asymptotic analysis, worst-case & average-case, recurrences,
lower bounds, NP-completeness.
Credits: 3.0
Prerequisites: CMSC 123
