CSC 215 - Algorithm Design and Analysis
 
(3 cr.) This course presents a study of the design and analysis of algorithms. Topics include Asymptotic Analysis, Complexity Theory, Sorting and Searching, Underlying Data Structures, Recursion, Greedy Algorithms, Divide and Conquer, Dynamic Programming, and NP-completeness. Additional topics may include Graph Algorithms, Probabilistic Algorithms, Distributed Computing and Parallel Algorithms. Prerequisite: CSC 111, CSC 205; Minimum grade C-; Every Year, Fall
 
Sessions

Fall 2014