This course develops the skill of analyzing the behavior of algorithms. Topics include the analysis — with respect to average and worst case behavior — and correctness of algorithms for internal sorting, pattern matching on strings, graph algorithms, and methods such as recursion elimination, dynamic programming, and program profiling. Students will be expected to write and analyze programs. Undergraduate credit may not be earned both for this course and for CS 5084. This course will be offered in 2022-23, and in alternating years thereafter.
Recommended Background
Algorithms (CS 2223 or equivalent), and some knowledge of probability.