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, CS 250 - Systems Programming, and CS 260 - Object-Oriented Programming and Design.
Credits: 3
NOTE:
* Honors Scholar Course.
** This course counts toward the 63-credit Liberal Arts and Sciences (LAS) graduation requirement.