Description
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.
Prerequisites
- Prerequisite(s): ( COMP 1006 or COMP 1406 ) with a minimum grade of C- .
Conditions and arrangements
- Precludes additional credit for Precludes additional credit for SYSC 2100 .
- Prerequisite(s): ( COMP 1006 or COMP 1406 ) with a minimum grade of C- .
- Lectures three hours a week.
Reference text in its original language
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.
- Prerequisite(s): ( COMP 1006 or COMP 1406 ) with a minimum grade of C- .
- Precludes additional credit for Precludes additional credit for SYSC 2100 .
- Lectures three hours a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/COMP/