CS 226 - Data Structures and Algorithms

Prerequisite: CS 210; CS 166 is also recommended. Intermediate program design and debugging in Java. The nature and application of 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