Courses & Units

Data Structures and Algorithms KIT205

Hobart, Launceston

Note:

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 College of Sciences and Engineering
School of Information and Communication Technology
Discipline Information & Communication Technology
Coordinator Doctor Robert Ollington
Available as student elective? Yes
Delivered By University of Tasmania
Level Intermediate

Availability

Location Study period Attendance options Available to
Hobart Semester 1 On-Campus International Domestic
Hobart Semester 2 On-Campus International Domestic
Launceston Semester 1 On-Campus International Domestic
Launceston Semester 2 On-Campus International Domestic

Key

On-campus
Off-Campus
International 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 2 11/7/2022 9/8/2022 29/8/2022 16/10/2022
Semester 1 21/2/2022 22/3/2022 11/4/2022 29/5/2022

* 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 (see withdrawal dates explained for more information).

Unit census dates currently displaying for 2022 are indicative and subject to change. Finalised census dates for 2022 will be available from the 1st October 2021. 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
  • create diagrams to reason and communicate about data structures and algorithms
Field of Education Commencing Student Contribution 1 Grandfathered Student Contribution 1 Approved Pathway Course Student Contribution 2 Domestic Full Fee
029999 $1,002.00 $1,002.00 not applicable $2,402.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 here more information on student contribution amounts.
2 Information on eligibility and Approved Pathway courses can be found here
3 Please refer here for eligibility for HECS-HELP
4 Please refer here for eligibility for FEE-HELP

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

Please note: international students should refer to this page to get an indicative course cost.

Requisites

Prerequisites

KIT107

Teaching

Teaching Pattern

Lectures: ~2 hr/wk online
Tutorials: 2 hr/wk (from week 2) Online and on-campus options.

AssessmentQuizzes (x10) (10%)|Lab Work Test (5%)|Examination (60%)|Assignment - Data Storage Application (10%)|Assignment - Network-based Computing Problem (15%)
TimetableView the lecture timetable | View the full unit timetable

Textbooks

Required

N/A

Recommended

N/A

LinksBooktopia textbook finder

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