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: A grade of C or better in each of CS 191 - Computing Structures and CS 260 - Object-Oriented Programming and Design.
Credit(s): 3
Course Attribute(s):

Honors Scholar Course.