Overview

Indicative content includes:

• Data structures and abstract data types; arrays, linked-lists, stacks, queues, sets and binary search trees.
• Algorithms: sorting, insertion, deletion, searching, iterative and recursive algorithms.
• Mathematics: powers, exponentials, logarithms, series summations, recurrences, sets and Venn diagrams.
• Efficiency measures for time and space: rates of growth, asymptotic behaviour, and big-O notation.

Learning Outcomes

• Describe and utilise, in mathematical terms, lists, sets, matrices and graphs.

• Describe the concepts of fundamental data structures and algorithms.

• Evaluate algorithms, in terms of efficiency, using complexity theory.