CMP 410: Data Structures and Algorithms II.
4 hours, 4 credits. Design and analysis of algorithms: Worst and average case behavior. Design strategies, such as divide and conquer, the greedy principle, dynamic programming, and backtracking, are illustrated by examples chosen from sorting and searching, applications of graph theory, scheduling, pattern matching, matrix multiplication, and other topics. NP-complete problems. Parallel processing and algorithms. PREREQ: CMP 338. PRE- or COREQ: MAT 313.
Last modified: 11/20/2014