Year 3 Fall (0.5 Credits) | Carleton University
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. Includes: Experiential Learning Activity Precludes additional credit for PLT 3010.
Prerequisites: BIT 2400