CSCI 2226 - Data Structures and Algorithms

Prerequisite: CSCI 2210 or CSCI 2212 ; CSCI 1166 is also recommended. Intermediate program design and debugging. 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, heaps, 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.

3 credits