UnitLevel 2Undergraduate

FIT2004 Algorithms and data structures

Faculty of Information Technology

FIT2004 Algorithms and data structures is a level 2, 6-credit-point, undergraduate unit from the Faculty of Information Technology, offered in 2020 in Semester 1 and Semester 2 at Clayton and Malaysia. It has no prerequisites and unlocks 8 units, leading on to 12 units in all. Students rate it 5.0 out of 5 from 2 reviews and call it hard.

Credit points
6
Offered in 2020
Semester 1, Semester 2
Clayton, Malaysia
Assessment
Exam 60%
and 1 other task
Workload
144 hours
per semester

This is the 2020 handbook entry. See the 2026 entry.

Reviews

Rated 5.0 out of 5 from 2 reviews
5.02 reviews
  1. 5 stars: 2
  2. 4 stars: 0
  3. 3 stars: 0
  4. 2 stars: 0
  5. 1 star: 0
Teaching
3.5out of 5 from 2 reviews
Content
5.0out of 5 from 2 reviews
Assessment
4.0out of 5 from 2 reviews
Usefulness
5.0out of 5 from 2 reviews
Difficulty
Hard
Workload
Heavy

What students say

  • M15 October 2026 - Took it in 2024
    5 out of 5: Excellent

    I js love the coding units. Really hard at times. I remember being on discord vc up late doing the assignment whilst my friend bawled her eyes out cuz she could not for the life of her figure out network flows lmao. Great times.

    • Teaching3out of 5
    • Content5out of 5
    • Assessment5out of 5
    • Usefulness5out of 5
    • DifficultyHard
    • WorkloadModerate
  • JS5 October 2026 - edited - Took it in 2025
    5 out of 5: Excellent

    Hard, but worth it. Attending each tutorial is like the highest ROI things you can do in this unit as you can just brainstorm problem sets with your TAs

    • Teaching4out of 5
    • Content5out of 5
    • Assessment3out of 5
    • Usefulness5out of 5
    • DifficultyHard
    • WorkloadHeavy

Requisites

Overview

This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best, average and worst-case time and space complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.

Offerings in 2020

Teaching periodCampusMode
First semesterClaytonOn campus
First semesterMalaysiaOn campus
First semester (Fully flex)ClaytonFlexible
Second semesterClaytonOn campus
Second semesterMalaysiaOn campus

Assessment

  • In-semester assessmentThreshold hurdle
    40%
  • Examination (2 hours and 10 minutes)Threshold hurdle
    60%

Learning outcomes

When you finish this unit, you should be able to:

  1. 1

    Analyse general problem solving strategies and algorithmic paradigms, and apply them to solving new problems;

  2. 2

    Prove correctness of programs, analyse their space and time complexities;

  3. 3

    Compare and contrast various abstract data types and use them appropriately;

  4. 4

    Develop and implement algorithms to solve computational problems.

Workload and teaching

  • Studio activities36 hours
  • Lectures24 hours
  • Teaching approachActive 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

Required resources

Mark Allen Weiss. (2012). Data Structures and Algorithm Analysis in Java . (3rd Edition) Pearson (ISBN: 9780132576277).

Technology resources

Python (latest version) installed in the labs

Where it fits

FIT2004 is part of 5 areas of study in the 2020 handbook.

Contacts

Unit Coordinators
Dr Lim Wern Han
Chief Examiners
Mr Nathan Companez

Common questions

What are the prerequisites for FIT2004?

FIT2004 has no prerequisites, but enrolment rules apply.

What can I take after FIT2004?

FIT2004 is a prerequisite or corequisite for 8 units, including FIT3143, FIT3144, FIT3155, FIT3161, FIT3163 and FIT3170. Those lead on to 12 units in all.

When is FIT2004 offered?

In 2020, FIT2004 runs in Semester 1 and Semester 2 at Clayton and Malaysia.

Is FIT2004 hard?

Students who took it rate it hard to do well in and heavy on workload (2 ratings). The handbook expects about 144 hours of study across the semester.

Does FIT2004 have an exam?

Yes. The exam is worth 60% of the final mark, alongside 1 other task.

Which majors and minors include FIT2004?

FIT2004 is part of Computational science, Computer science and Software engineering.

What do students think of FIT2004?

It is rated 5.0 out of 5 from 2 reviews, and 2 students of 2 gave it 4 or 5 stars. Read the reviews above or add your own.

More details

Credit points
6
Level
2
Study level
Undergraduate
Faculty
Faculty of Information Technology
Type
Coursework
EFTSL
0.125
Student contribution
SCA Band 2
Study abroad
Not available
Handbook years
2020202120222023202420252026