CMSI 281 Data Structures

3 semester hours

Introduction to the specification and design of data types, information structures, and algorithms, including detailed studies of collection classes and interfaces for sets, lists, stacks, queues, heaps, dictionaries, and more. Implementation techniques such as arrays, linked lists, hash tables, and efficient tree structures are presented, along with sorting, indexing, and hashing. Computational complexity, problem solving, and recursion are introduced.

Lecture, 3 hours.

Prerequisite: A grade of C (2.0) or better in CMSI 186 .

Print-Friendly Page (opens a new window)