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).
|Unit name||Data Structures and Algorithms|
|Faculty/School||College of Sciences and Engineering
School of Information and Communication Technology
|Discipline||Information & Communication Technology|
|Available as student elective?||Yes|
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.
Special approval is required for enrolment into TNE Program units.
* 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).
You cannot enrol in this unit as well as the following:
2hrs Lectures, 2hrs Tutorials
60% exam, 40% in-semester (1 participation 5%, 3 assignments: 10%, 10%, 15%)
|Timetable||View the lecture timetable | View the full unit timetable|
The University reserves the right to amend or remove courses and unit availabilities, as appropriate.