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.

Credit(s): 3
Prerequisite(s): Prerequisites: A grade of C or better in each of CS 191 - Computing Structures and CS 260 - Object-Oriented Programming and Design.
Disciplinary Perspective(s):
None
Interconnecting Perspective(s):
None
University Graduation Requirement(s):
Honors Scholar