Description
Specification and design of abstract data types and their implementation as stacks, queues, trees, tables and graphs. Common and useful examples. Parsing and finite state machines. Analysis of algorithms, recursion, re-entrance. Special focus: abstraction, interface specification and hierarchical design using object-oriented programming.
Prerequisites
- Prerequisite(s): BIT 2400 .
Conditions and arrangements
- Also listed as NET 3004 .
- Precludes additional credit for Precludes additional credit for PLT 3010 (no longer offered).
- Prerequisite(s): BIT 2400 .
- Lectures three hours a week, tutorial/laboratory two hours a week.
Reference text in its original language
Specification and design of abstract data types and their implementation as stacks, queues, trees, tables and graphs. Common and useful examples. Parsing and finite state machines. Analysis of algorithms, recursion, re-entrance. Special focus: abstraction, interface specification and hierarchical design using object-oriented programming.
- Prerequisite(s): BIT 2400 .
- Also listed as NET 3004 .
- Precludes additional credit for Precludes additional credit for PLT 3010 (no longer offered).
- Lectures three hours a week, tutorial/laboratory two 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/OSS/