CSCI 6620 - Data Structures

Prerequisite: CSCI 6610. The nature and application of the fundamental data structures and algorithms for arrays, growing arrays, lists, stacks, queues, priority queues, trees, and graphs. Algorithms include precedence parsing, heap-based priority queues, quicksort, radixsort, and hashing. Estimation of the time-efficiency of algorithms. Evaluation of the performance of different data structures for typical applications. Students will write and debug several projects in C++. 3 credit hours. 3 credits.