Specification, representation, and manipulation of basic data structures: linked lists, arrays, stacks, queues, trees, strings, symbol tables, Huffman codes, optimal search trees, pattern matching, priority queues, heaps, hash tables. Storage allocation, garbage collection, compaction, reference counts. List and string processing languages. Analysis of algorithms. Students are required to write programs in several languages.

Usually Offered:	Fall and Spring
Credit:	3 hours (class)
Prerequisite:	CS 182
University Catalog:	CS 251
Schedule:	Fall 2002 Instructor: Walid Aref CS251H Fall 2002 Instructor: Walid Aref
Syllabi:	Canonical