Introduction to algorithm analysis and Onotation. Abstract data types (lists, stacks, queues, trees, priority queues, dictionaries, sets), their implementations (linked lists, binary trees, heaps, binary search trees, balanced search trees, hash tables), and associated algorithms (iterators, enumerators, traversal, sorting, searching, retrieval). Prerequisites: AUCSC 120, AUMAT 110 or 111 or 116, and AUMAT 120. Corequisite: AUMAT 250.