CSC 3360 Analysis of Algorithms
Prerequisite: CSC 2320 and MAT 3381. Introduce formal techniques to support the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include computational complexity analysis, NP-completeness theory, sorting and searching, graphs, polynomial arithmetic, pattern matching, divide-conquer techniques, greedy methods, and dynamic programming.
Prerequisite
Required: Take CSC-2320 and MAT-3381.