MATH 220 Data Structures and Algorithms
This course introduces beginning-level abstract data structures and algorithms. Concentration is centered on design, analysis, and implementation. Data structure topics include a refresher in object-oriented programming, array-based sequences, stacks, queues, deques, and linked lists. Algorithm design topics include recursion, binary search, and basic sorting. Students are taught how to analyze and classify the computational complexity of an algorithm, i.e., asymptotic analysis (big O notation).