CMP 410 Data Structures and Algorithms II

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.  

Credits:

4

Hours

4

Requirement Designation

Regular Liberal Arts

Offered

Fall-Spring

Prerequisite

CMP 338 and MAT 313.