Data Structures and Algorithms

Catalog description

The purpose of this course is to acquire a grounding in the core principles of Abstract Data Types (ADT), and knowledge of the Algorithms associated with them. Students will learn methods for expressing and comparing algorithm complexity (worst- and average-case upper bounds, lower bounds) as well as to verifying correctness. The ADTs studied in this course include stack, queue, priority queue, hash table, and binary search tree. Algorithms for sorting and searching on those structures and the tradeoffs arising from ADT implementation with arrays and linked lists are also included. The knowledge gained will be applied to a variety of problems that require the design of more complex ADTs.