CS 600 Advanced Algorithm Design and Implementation

Design, implementation, and asymptotic time and space analysis of advanced algorithms, as well as analyzing worst-case and average-case complexity of algorithms. Students will be expected to run experiments to test the actual performance of the algorithms on sample inputs. Introduction to NP-complete problems and approximation algorithms.

Credits

3

Cross Listed Courses

CPE 600

Prerequisite

(CS 590 and MA 502) or CS 385

Distribution

Computer Engineering Program Computer Science Program

Typically Offered Periods

Fall Semester Spring Semester