CS 251 - Data Structures

Semester Hours: 4

A course on the use, implementation and analysis of data structures and algorithms. Data structures to be studied include balanced search trees, hash tables, priority queues and disjoint sets. Advanced sorting algorithms and recursive techniques are also studies, along with mathematical techniques for algorithm analysis. Students will also be introduced to a second programming language.

Prerequisite: CS 152.
Corequisite: MTH 241.

When Offered: (Offered Fall semester.)