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. Includes: Experiential Learning Activity Precludes additional credit for COMP 2402. Prerequisite(s): (SYSC 1006 or SYSC 2006) with a minimum grade of C-, and second-year status in Engineering. Lectures three hours a week, laboratory two hours a week, problem analysis one hour alternate weeks.
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. Includes: Experiential Learning Activity Precludes additional credit for COMP 2402. Prerequisite(s): (SYSC 1006 or SYSC 2006) with a minimum grade of C-, and second-year status in Engineering. Lectures three hours a week, laboratory two hours a week, problem analysis one hour alternate weeks.
