CSCI 20000 - Algorithm Analysis

Course Credit: 1
Maximum Credit: 0

This course covers standard and advanced algorithms for problem solving in computer science. Brute force, recursion, greedy strategies, and dynamic programming techniques are applied to real world problems. Time-space analysis is performed for various algorithm and data structure pairings. The limitations of algorithms are also studied in the context of NP-completeness. Prerequisite(s): MATH 12000, MATH 13000, and either CSCI 12000 or CSCI 23000 Annually.