FIT4051 · Advanced algorithms and data structures

Overview

This unit extends the algorithmic core of the degree by studying advanced data structures, deeper analysis techniques, and powerful algorithmic strategies for challenging computational problems. It explores space-efficient and time-efficient representations, advanced searching and sorting methods, string, tree, number, and graph manipulation algorithms as well as efficient combinatorial algorithms. You will learn to design and implement solutions for large and complex problem instances, justify correctness formally, and evaluate algorithmic choices in terms of asymptotic behaviour as well as practical performance.

Offerings

The Handbook publishes no offerings for this unit.

Assessment

The Handbook publishes no assessment items for this unit yet.

Assessment details may change. Please refer to the assessment information in Moodle closer to the start of the teaching period.

Requisites

Learning outcomes

1. Investigate challenging computational problems by selecting and adapting advanced algorithmic strategies, evaluating alternative approaches and justifying chosen solutions with formal correctness arguments and experimental evidence;
2. Design and document advanced algorithmic and data-structure solutions through specifications, invariants and complexity analyses that support implementation and rigorous review;
3. Document advanced software designs that explain how a complex algorithmic solution is structured, how its components compose, and how its behaviour can be tested and maintained;
4. Construct and verify analytical models of algorithmic behaviour for large instances, including amortised, randomised and approximation analyses.

Workload

No workload detail published.

Student experience, not official rules. Nothing here changes what the Handbook says.