Data Structures and Algorithms

Catalog description

An introduction to data structures and algorithms. Topics include asymptotic notation recurrence relations, sorting, hash tables, basic priority queues, balanced search trees and basic graph representation and search. This is a double-starred (**) level course and may be taken for graduate credit by students enrolled in a graduate program outside of the department. A graduate student enrolled in a double-starred course numbered below 500 may be required to complete extra work.