CS 5610D - Data Structures

Various data structures, algorithms associated with data structures, and analysis of algorithms are explored. Topics include analysis of algorithms, dynamic arrays, tree structures, heaps, balanced trees, dictionaries, graphs and graph algorithms, and the complexity of sorting. Graph algorithms for depth first and breadth first search, shortest path, minimum cost spanning trees, and others are covered. Coverage of built in data structures and algorithms in modern programming languages included.

Requisites

Credit Hours: 4.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture, 1.0 recitation

Eligible grades: A-F,WP,WF,FN,FS,AU,I