Courses & Units
Programming KIT107
Introduction
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.
Summary
Unit name | Programming |
---|---|
Unit code | KIT107 |
Credit points | 12.5 |
College/School | College of Sciences and Engineering School of Information and Communication Technology |
Discipline | Information & Communication Technology |
Coordinator | Doctor Julian Dermoudy |
Available as an elective? | Yes |
Delivered By | University of Tasmania |
Level | Introductory |
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 1 | 20/2/2023 | 21/3/2023 | 10/4/2023 | 28/5/2023 |
Semester 2 | 10/7/2023 | 8/8/2023 | 28/8/2023 | 15/10/2023 |
* 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 2023 are indicative and subject to change. Finalised census dates for 2023 will be available from the 1st October 2022. Note census date cutoff is 11.59pm AEST (AEDT during October to March).
Learning Outcomes
- 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,3 | Grandfathered Student Contribution 1,3 | Approved Pathway Course Student Contribution 2,3 | Domestic Full Fee 4 |
---|---|---|---|---|
029999 | $1,037.00 | $1,037.00 | not applicable | $2,522.00 |
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 UConnect 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
KIT101 OR KIT103Teaching
Teaching Pattern | Lectorials: 2x1 hr/wk |
---|---|
Assessment | Examination (40%)|Assignment 0 (Formative Task)|Assignment 1 (Pair-based) (12%)|Assignment 2 (Individual) (24%)|Assignment 3 (Pair-based) (24%) |
Timetable | View the lecture timetable | View the full unit timetable |
Textbooks
Required |
N/A |
---|---|
Recommended | N/A | Links | Booktopia textbook finder |
The University reserves the right to amend or remove courses and unit availabilities, as appropriate.