CST 261 - Data Structures

This course investigates abstract data types (ADTs), recursion, algorithms for searching and sorting, and basic algorithmic analysis using an object-oriented language. Data structures to be covered include, but not limited to strings, arrays, lists, stacks, queues, trees, and heaps. Students also will explore the use of a variety of data structures and useful algorithms, such as searching and sorting, in the context of modeling and simulation.
Prerequisite: CST 162.
4 lecture hours per week.
4 credit hours.