CSC 4450. Design and Analysis of Algorithms (3 credits)
This course covers time and space complexity of algorithms. Survey of various design techniques such as "divide and conquer" and the "greedy" method is covered. Program verification and validation as well as NPComplete and NPHard problems are discussed. PREREQ: CSC 2850, and MAT 2220.