CS 310 - Data Structures and Algorithms

A continuation of the study of abstract data types and their implementations in a high-level language. Topics include lists, trees, priority queues, and graphs as well as efficient searching and sorting algorithms.

Prerequisites:

CS 191 - Computing Structures

and

CS 260 - Object-Oriented Programming and Design

.
Credits: 3
NOTE: Honors Scholar Course.
NOTE: This course counts toward the 63-credit Liberal Arts and Sciences (LAS) graduation requirement.