4 credit hours
Prerequisite: CSCI 251 with a grade of C or higher.
Students must receive a grade of C or better in the prerequisites. An in-depth study of data structures, including arrays, records, stacks, queues, lists, trees, heaps and hash tables. The study includes the definition, specification, and implementation of these structures, as well as examples of their uses. Also included is an introduction to the internal representation of information.