Go to Courses and units

Data Structures and Algorithms unit (KIT205)

eStudent Enquire

Unit year 2026

View 2025 unit information

View previous years unit information

Quick Help

2027 Unit information is now available. View 2027 unit information

Location: Melbourne Study Centre, Hobart, Launceston, Online

Introduction

This unit extends the first year treatment in KIT107 of standard data structures and algorithms for solving computational problems. Topics include: data structures (such as balanced trees and hash tables) for collections, (binary heaps for) priority queues, sorting algorithms (e.g. heapsort, mergesort and quicksort), graphs and graph algorithms (e.g. for searching, topological sorting, critical path analysis, shortest paths, minimum spanning trees, network flow), pattern finding (for substrings and regular expressions), algorithmic problem solving and algorithm design techniques (e.g. greed, divide and conquer, dynamic programming, backtracking).

Summary

Unit name Data Structures and Algorithms
Unit code KIT205
Credit points 12.5
College/School Sciences and Engineering
School of Information and Communication Technology
Discipline Information & Communication Technology
Coordinator Doctor Muhammad Bilal Amin
Available as an elective? Yes
Delivered By University of Tasmania
Level Intermediate

Availability

Location Study period Attendance options Available to
Melbourne Study Centre Semester 1 This unit is available through on-campus delivery Available to International Students
Hobart Semester 1 This unit is available through on-campus delivery Available to International Students Available to Domestic Students
Launceston Semester 1 This unit is available through on-campus delivery Available to International Students Available to Domestic Students
Online Semester 1 This unit is available through off-campus delivery Available to International Students Available to Domestic Students
  • Key:
  • This unit is available through on-campus delivery On-campus
  • This unit is available through off-campus delivery Off-Campus
  • Available to International Students International students
  • Available to Domestic Students Domestic students
Note

Please check that your computer meets the minimum System Requirements if you are attending via Distance/Off-Campus.

Units are offered in attending mode unless otherwise indicated (that is attendance is required at the campus identified). A unit identified as offered by distance, that is there is no requirement for attendance, is identified with a nominal enrolment campus. A unit offered to both attending students and by distance from the same campus is identified as having both modes of study.

Key Dates

Study Period Start date Census date WW date End date
Semester 1 22/2/2026 16/3/2026 19/4/2026 13/6/2026

* The Final WW Date is the final date from which you can withdraw from the unit without academic penalty, however you will still incur a financial liability (refer to How do I withdraw from a unit? for more information).

Unit census dates currently displaying for 2026 are indicative and subject to change. Finalised census dates for 2026 will be available from the 1st October 2025. Note census date cutoff is 11.59pm AEST (AEDT during October to March).

About Census Dates

Learning Outcomes

  • transform a real-world problem into a simple abstract form that is suitable for efficient computation
  • implement common data structures and algorithms using a common programming language
  • analyse the theoretical and practical run time and space complexity of computer code in order to select algorithms for specific tasks
  • apply common algorithm design strategies to develop new algorithms when there are no pre-existing solutions

Fee Information

Field of Education Commencing Student Contribution 1,3 Grandfathered Student Contribution 1,3 Approved Pathway Course Student Contribution 2,3 Domestic Full Fee 4
029999 $1,192.00 $1,192.00 not applicable $2,919.00
  • Available as a Commonwealth Supported Place
  • HECS-HELP is available on this unit, depending on your eligibility3
  • FEE-HELP is available on this unit, depending on your eligibility4

1 Please refer to more information on student contribution amounts.
2 Please refer to more information on eligibility and Approved Pathway courses.
3 Please refer to more information on eligibility for HECS-HELP.
4 Please refer to more information on eligibility for FEE-HELP.

If you have any questions in relation to the fees, please contact UniConnect or more information is available on StudyAssist.

Please note: international students should refer to What is an indicative Fee? to get an indicative course cost.

Requisites

Prerequisites

KIT107

Teaching

Teaching Pattern

On-Campus enrolments in Hobart and Launceston: 

Seminar: ~2 hr (only in the first week of the semester)
Independent Learning: ~2 hr/wk online
Tutorials: 2 hr/wk (from week 2) 

On-Line teaching arrangements may differ and will be advised by your teaching team.

On-Campus Melbourne teaching arrangements may differ and will be advised by your teaching team.

 

AssessmentQuizzes (x10) (10%)|Lab Work (20%)|Assignment - Data Storage Application (30%)|Assignment - Graph-based Computing Problem (40%)
TimetableView the lecture timetable | View the full unit timetable

Textbooks

Required

N/A
Recommended

N/A

The University reserves the right to amend or remove courses and unit availabilities, as appropriate.