Note: This is an archived Handbook entry from 2012.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2012:Semester 1, Parkville - Taught on campus.
Semester 2, Parkville - Taught on campus.
Timetable can be viewed here. For information about these dates, click here.
|Time Commitment:||Contact Hours: one, 3 hour lecture per week |
Total Time Commitment:
An undergraduate degree in a cognate discipline.
|Recommended Background Knowledge:|| |
Basic proficienty in mathermatics and computing.
|Non Allowed Subjects:|| |
|Core Participation Requirements:||
For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Students Experiencing
CoordinatorDr Antonette Mendoza, Dr Tony Wirth, Dr Udaya Parampalli
Dr Aaron Harwood
Topics covered include complexity classes and asymptotic notations; empirical analysis of algorithms; abstract data types including queues, trees, heaps and graphs; algorithmic techniques including brute force, divide-and-conquer, dynamic programming and greedy approaches; space and time trade-offs; and the theoretical limits of algorithm power.
On successful completion of this subject students should:
|Breadth Options:|| |
This subject is not available as a breadth subject.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
On successful completion students should:
Bachelor of Computer Science (Honours) |
Master of Engineering in Distributed Computing
Master of Information Technology
Master of Operations Research and Management Science
Master of Science (Bioinformatics)
Postgraduate Certificate in Engineering
Master of Engineering (Mechatronics) |
Master of Engineering (Software)
Download PDF version.