*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).
The primary focus of the unit is on standard algorithms (and data structures) for solving computing problems - including storing, searching and sorting; various graph problems; and some string problems - and (analysis of) the corresponding run-time (and space) complexity. The unit starts with an introduction to programming in C (presupposing a knowledge of Java).
WEIGHT:
12.5%
ASSESSMENT: In-semester assignments (30% total), 3-hour final examination (70%)
TEACHING PATTERN: 3 lectures, 1 tutorial weekly
FLEXIBLE & ONLINE STUDY OPTIONS Note: Class attendance may still be required
Web dependent -
H,L
Some parts of this unit will be taught online
Resource supported teaching & learning -
H,L
Additional resources are provided for your optional use; e.g. audio taped lectures
About Flexible Study Options
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.
Campus - H Hobart, L Launceston, W Burnie. Study Centre - V Sydney, R Rozelle, P Beauty Point. Distance units may also have a campus identifier of I Isolated, N Interstate, O Overseas. Units delivered in Transnational Education (TNE) Programs have a campus identifier of A Hangzhou, F Fuzhou, G Shanghai, K KDU Malaysia, Q Kuwait or Y Hong Kong.
Special approval is required for enrolment into TNE Program units - campuses A, F, G, K, Q and Y click here for more information.
Web dependent -
H,L
