Information Technology
(BIT, IMD, NET)
Carleton School of Information Technology
Algonquin College of Applied Arts and Technology
NET 3004 [0.5 credit]
Data Structures
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:
NET 2006.
Lectures three hours a week, tutorial/laboratory two hours a week.