FIT1054 Fundamentals of algorithms (Advanced)
Faculty of Information Technology
FIT1054 Fundamentals of algorithms (Advanced) is a level 1, 6-credit-point, undergraduate unit from the Faculty of Information Technology, offered in 2024 in Semester 2 at Clayton. It needs FIT1045 or FIT1053 and unlocks 5 units, leading on to 31 units in all.
- Credit points
- 6
- Offered in 2024
- Semester 2
- Clayton
- Assessment
- No exam
- 4 tasks
- Workload
- 144 hours
- per semester
This is the 2024 handbook entry. See the 2026 entry.
Reviews
No reviews yetNo reviews yet. Be the first to review FIT1054.
Requisites
Before FIT1054
Prohibitions
You can't enrol if you have passed any of these.
Prerequisites
Pass these before you enrol.
After FIT1054
5 units list FIT1054 as a prerequisite or corequisite.
Equivalent units
The same content under another code. Only one of them counts.
Overview
This unit introduces students to core problem-solving, analytical skills, and methodologies useful for developing flexible, robust, and maintainable software. In doing this, it covers a range of conceptual levels, from fundamental algorithms and data structures, down to their efficient implementation as well as complexity. Topics include data types, data structures, algorithms, algorithmic complexity, recursion, and their practical applications.
Offerings in 2024
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On campus |
Assessment
- Assignment 1Assignment35%
- Assignment 2Assignment35%
- Assignment 3Assignment15%
- Weekly QuizzesOther15%
Learning outcomes
When you finish this unit, you should be able to:
- 1
Translate problem statements into algorithms and implement them in a high level programming language;
- 2
Determine appropriate basic abstract data types, including; stacks, queues, lists, binary trees, priority queues, heaps and hash tables; for specific contexts;
- 3
Theoretically and experimentally evaluate different implementations of basic abstract data types;
- 4
Analyse the efficiency of algorithms by determining their best-case and worst-case big-O time complexity;
- 5
Work in teams to analyse algorithms and write programs.
Workload and teaching
- Workshops24 hours
- Applied sessions24 hours
- Teaching approachPeer assisted learning
Minimum total expected workload to achieve the learning outcomes for this unit is 144 hours per semester typically comprising a mixture of scheduled online and face to face learning activities and independent study. Independent study may include associated reading and preparation for scheduled teaching activities.
Learning resources
Recommended resources
Introduction to Algorithms Authors: Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein
Problem-Solving with algorithms and data structures using Python Author: Miller & Ranum [also freely available online under CC license: https://interactivepython.org/runestone/static/pythonds/index.html]
Data Structures & Algorithms in Python Authors: Goodrich, Tamassia & Goldwasser
Technology resources
Python 3: This will be our programming language. Please make sure you get at least version 3.3 - https://www.python.org/downloads/
PyCharm : A good Python IDE. http://www.jetbrains.com/pycharm/
Where it fits
FIT1054 is part of 3 areas of study in the 2024 handbook.
Contacts
- Chief Examiners
- Dr Alexey Ignatiev
Common questions
What can I take after FIT1054?
FIT1054 is a prerequisite or corequisite for 5 units, including FIT2004, FIT2014, FIT2099, FIT2102 and FIT3179. Those lead on to 31 units in all.
When is FIT1054 offered?
In 2024, FIT1054 runs in Semester 2 at Clayton.
How much work is FIT1054?
The handbook expects about 144 hours of study across the semester. No students have rated its difficulty yet.
Does FIT1054 have an exam?
No. FIT1054 has 4 assessment tasks and no exam.
Which majors and minors include FIT1054?
FIT1054 is part of Computational science.