Overview

• Data structures and abstract data types; arrays, linked-lists, stacks, queues, sets, maps, and binary search trees. • Algorithms: sorting, insertion, deletion, searching, traversal, iterative and recursive algorithms. • Efficiency measures for time and space: rates of growth; asymptotic behaviour, big-O notation. Algorithm complexity classes. Constraints and Trade offs (time vs. space).

Assessment Strategy

-threshold -40%

-good -60%

-excellent -70%

Learning Outcomes

• Discuss the operation of common search and sort algorithms relating to the ADTs.

• Estimate the impact, in terms of space and time, of algorithms using Complexity Theory.

• Identify common Abstract Data Types (ADTs) and their respective qualities and limitations.