This module provides the student with the knowledge and skills to analyse, design, develop, test and debug applications using data structures and algorithms.
Basic Data Structures
Vectors, lists, stacks, hash tables, circular arrays, maps and dictionaries
Basic Algorithms
Algorithms as a problem analysis tool, sorting & searching algorithms, introduction to pattern matching algorithms.
Recursion.
Introduction to recursive algorithms, recursive tree traversals, memory usage.
Analysis of Algorithms
Program costs: time and space, worst case and average case analysis, "big O" notation, polynomial andexponential growth.
Intermediate Data Structures
Queues, deque trees, heaps, priority queues, graphs.
Intermediate Algorithms
Advanced sorting & searching techniques, advanced pattern matching.
| Module Content & Assessment | |
|---|---|
| Assessment Breakdown | % |
| Other Assessment(s) | 100 |