4 hours, 4 credits. Abstract characterizations of data structures, such as arrays, stacks, queues, trees, and graphs, will be studied along with algorithms that make use of such structures, including algorithms for sorting, searching, and memory management. Implementation issues will be considered, and students will write programs that embody these structures and algorithms. PREREQ: CMP 232 andCMP 326.