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 172 or CS 181) and CS 191.
Credits: 3 hours
NOTE: General Honors Course.
NOTE: This course counts toward the 63-hour Liberal Arts and Sciences (LAS) graduation requirement.