CPS 2233 DATA STRUCTURES AND ALGORITHMS
Foundations of data structures and algorithmic design in computer science. Topics include abstract data types; lists, sets, stacks, queues, trees, and graphs; recursion and dynamic programming; algorithm correctness; asymptotic complexity analysis; recurrence relations; and fundamental design paradigms such as divide-and-conquer and greedy methods.
Prerequisite
CPS*2231 and MATH*2110