Computer Science (COMP)
School of Computer Science
Faculty of Science
COMP 2002 [0.5 credit]
Abstract Data Types and Algorithms
Introduction to the design and implementation of abstract data types and to the 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 2402 and
SYSC 2002.
Prerequisite:
COMP 1006.
Lectures three hours a week.