Thorough coverage of fundamental abstract collections: stacks, queues, lists, priority queues, dictionaries, sets, graphs. Data structures: review of arrays and linked lists; trees, heaps, hash tables. Specification, design, implementation of collections, complexity analysis of operations. Sorting algorithms. Precludes additional credit for SYSC 2002. Prerequisite(s): SYSC 1102 or SYSC 2006.Lectures three hours a week, laboratory two hours a week.
Thorough coverage of fundamental abstract collections: stacks, queues, lists, priority queues, dictionaries, sets, graphs. Data structures: review of arrays and linked lists; trees, heaps, hash tables. Specification, design, implementation of collections, complexity analysis of operations. Sorting algorithms. Precludes additional credit for SYSC 2002. Prerequisite(s): SYSC 1102 or SYSC 2006.Lectures three hours a week, laboratory two hours a week.