Data Structures and Algorithms unit (KIT205)

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

Specific information on 2027 unit availability will be available in August

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

2027 fee information will be available in August.

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.
Assessment	Quizzes (x10) (10%)|Lab Work (20%)|Assignment - Data Storage Application (30%)|Assignment - Graph-based Computing Problem (40%)
Timetable	View 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.