CSDP 450 Algorithms and Data Structures

Credit 3
This course will focus on the design and analysis of algorithms. Topics include: review of data structures, analysis of algorithms, brute force algorithms, searching techniques, divide-and-conquer, sorting and selection, dynamic programming, graph algorithms, greedy algorithms, P and NP, and coping with NP-completeness. Prerequisite(s): A grade of ‘C’ or better in CSDP 250 and MATH 323.