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 Also listed as NET 3004. Precludes additional credit for PLT 3010 (no longer offered). Prerequisite(s): BIT 2400. Lectures three hours a week, tutorial/laboratory two hours a week.
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 Also listed as NET 3004. Precludes additional credit for PLT 3010 (no longer offered). Prerequisite(s): BIT 2400. Lectures three hours a week, tutorial/laboratory two hours a week.
