Introduction to the design and implementation of abstract data types and to complexity analysis of data structures. Topics include: stacks, queues, lists, trees and graphs. Special attention is given to abstraction, interface specification and hierarchical design using an object-oriented programming language. Precludes additional credit for COMP 2002 and SYSC 2002. Prerequisite(s): one of COMP 1406, COMP 1006, SYSC 2004. Restricted to students registered in the B.C.S. program, combined Honours in Computer Science and Mathematics, Honours Computer Mathematics, and Honours Statistics.Lectures three hours a week.
