A study of abstract data types, including lists, stacks, queues, and search tables, and their supporting data structures, including arrays, linked lists, binary search trees, and hash tables. Implications of the choice of data structure on the efficiency of the implementation of an algorithm. Efficient methods of sorting and searching.
Counts towards the Mathematics major and minor.
Counts towards the Computer Science major and minor.
Counts as an elective in the Data Science interdisciplinary minor.
Satisfies the Mathematical and Quantitative Thought requirement.
Computer Science 121, 200, 209, or permission of instructor.