Note: In summer this unit will only have online classes in 2022. All lectures and tutorials will be available online only in summer.
This unit extends the students' knowledge and experience of programming. It introduces dynamic data structures, foundational collection abstract data types, and computational algorithms and techniques. Programming is undertaken in Java and C and topics include: references and pointers, memory management, self-referential data structures, abstract data types and their implementation, and an introduction to algorithm complexity.
|College/School||College of Sciences and Engineering
School of Information and Communication Technology
|Discipline||Information & Communication Technology|
|Coordinator||Doctor Julian Dermoudy|
|Available as student elective?||Yes|
|Delivered By||University of Tasmania|
|Location||Study period||Attendance options||Available to|
|Launceston||5 Week Session Jan B||On-Campus||International||Domestic|
|Hobart||5 Week Session Jan B||On-Campus||International||Domestic|
- International students
- Domestic students
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.
|Study Period||Start date||Census date||WW date||End date|
|5 Week Session Jan B||10/1/2022||17/1/2022||27/1/2022||13/2/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.
- specify abstract data types and implement them in both an object-oriented and a procedural programming context
- develop and analyse programs containing dynamic data structures through the application of knowledge of computing principles and technical skills
- employ pair-programming techniques while collaborating with peers
|Field of Education||Commencing Student Contribution 1||Grandfathered Student Contribution 1||Approved Pathway Course Student Contribution 2||Domestic Full Fee|
- 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
Please note: international students should refer to this page to get an indicative course cost.
PrerequisitesKIT101 OR KIT103
Lectures: 3 hr/wk
|Assessment||Examinaton (50%)|Assignment 0 (Formative Task)|Assignment 1 (Pair-based) (10%)|Assignment 2 (Individual) (20%)|Assignment 3 (Pair-based) (20%)|
|Timetable||View the lecture timetable | View the full unit timetable|
|Links||Booktopia textbook finder|
The University reserves the right to amend or remove courses and unit availabilities, as appropriate.