CSCI 20000 - Algorithm Analysis

Course Credit: 1
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): CSCI 12000, and either MATH 21500, MATH 21500, OR MATH 21100 Annually.