FIT1054 Computer science (advanced)
Faculty of Information Technology
FIT1054 Computer science (advanced) is a level 1, 6-credit-point, undergraduate unit from the Faculty of Information Technology, offered in 2020 in Semester 2 at Clayton. It has no prerequisites and unlocks 1 unit.
- Credit points
- 6
- Offered in 2020
- Semester 2
- Clayton
- Assessment
- Exam 60%
- and 1 other task
- Workload
- 144 hours
- per semester
This is the 2020 handbook entry. See the 2026 entry.
Reviews
No reviews yetNo reviews yet. Be the first to review FIT1054.
Requisites
Before FIT1054
No prerequisites or corequisites besides the enrolment rules below.
After FIT1054
1 unit list FIT1054 as a prerequisite or corequisite.
Enrolment rules
Prerequisites: ((One of FIT1040, ECE2071, FIT1002) and FIT1029) or FIT1045 or FIT1053
Students beginning FIT1054 are assumed to be able to: Identify the main components of an algorithm (variables, operators, expressions, etc), and write the algorithm associated to the specification of a simple problem. Be able to translate a simple algorithm into a program containing variable declarations, selection, repetition, and lists and/or arrays.
Prohibitions: FIT1015, FIT1008, FIT2085
Overview
This unit introduces students to core problem-solving, analytical skills, and methodologies useful for developing flexible, robust, and maintainable software. It covers a range of conceptual levels, from high-level algorithms and data-structures, down to the machine models and simple assembly language programming. Topics include data types; data structures; algorithms; algorithmic complexity; recursion and translation to assembly language.
Offerings in 2020
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On campus |
Assessment
- In-semester assessment40%
- Examination (3 hours and 10 minutes)Threshold hurdle60%
Learning outcomes
When you finish this unit, you should be able to:
- 1
Translate simple problem statements into algorithms, implement them in a high level programming language and test them.
- 2
Summarise and compare the properties of basic abstract data types such as stacks, queues, lists, trees, priority queues, heaps and hash tables.
- 3
Evaluate different algorithms and implementations of basic abstract data types.
- 4
Analyse algorithms by determining their best case and worst case big O time complexity.
- 5
Design efficient solutions combining basic abstract data types and applying the concepts of complexity while understanding its implications in practical situations.
- 6
Describe the classic RISC pipeline and how machine architecture can affect processor performance.
- 7
Deconstruct simple high-level code into assembly code such as MIPS R20
Workload and teaching
- Tutorials24 hours
- Workshops12 hours
- Laboratories36 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 activities. The unit requires on average three/four hours of scheduled activities per week. Scheduled activities may include a combination of teacher directed learning and online engagement.
Learning resources
Recommended resources
MIPS Assembly Language Programming Author: Britton
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/
MARS (MIPS Assembler and Runtime Simulator): An IDE for MIPS Assembly Language Programming. http://courses.missouristate.edu/kenvollmar/mars/
Where it fits
FIT1054 is part of 3 areas of study in the 2020 handbook.
Contacts
- Chief Examiners
- Dr Pierre Le Bodic
Common questions
What are the prerequisites for FIT1054?
FIT1054 has no prerequisites, but enrolment rules apply.
What can I take after FIT1054?
FIT1054 is a prerequisite or corequisite for 1 unit, including FIT2102.
When is FIT1054 offered?
In 2020, 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?
Yes. The exam is worth 60% of the final mark, alongside 1 other task.
Which majors and minors include FIT1054?
FIT1054 is part of Computational science.