CS 4102

Course Description

Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide-and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems. Prerequisite: CS 2150 or CS 2501 topic DSA2 with a grade of C- or higher, and CS 2102 or CS 2120 with grades of C- or higher, and APMA 1090 or MATH 1210 or MATH 1310.