AA study of the theory and implementation of specific data structures (including stacks, queues, trees, graphs and hash tables) and their associated algorithms incorporated into abstract data types (ADTs). Prerequisites: MATH 1601 and CIS 2400.