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: 24 one-hour lectures (two per week) and 12 one-hour workshops (one per week) |
Total Time Commitment:
25 points of university-level Mathematics, AND one of the following:
Study Period Commencement:
Semester 1, Semester 2
Semester 1, Semester 2
Please Note: A mark of 80 or more must be obtained in COMP20005 Engineering Computation.
|Recommended Background Knowledge:|| |
|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 Academic Disadvantage Policy, academic requirements for this subject are articulated in the Subject Overview, Objectives, Assessment and Generic Skills sections of this entry.
It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and the Disability Liaison Unit: http://www.services.unimelb.edu.au/disability/
CoordinatorDr Rui Zhang, Dr Tony Wirth
Associate Professor Tim Baldwin
Programmers can choose between several representations of data. These will have different strengths and weaknesses, and each will require its own set of algorithms. This subject will cover some of the most frequently used data structures and their associated algorithms. The emphasis will be on justification of algorithm correctness, on analysis of algorithm performance, and on choosing the right data structure for the problem at hand. Topics include: justification of algorithm correctness; asymptotic and empirical analysis of algorithm performance; algorithms for sorting and searching, including fundamental data structures such as trees and hash tables; and graph algorithms.
On successful completion of the subject students should be able to:
To pass the subject, students must obtain at least:
|Prescribed Texts:|| |
|Breadth Options:|| |
This subject potentially can be taken as a breadth subject component for the following courses:
You should visit learn more about breadth subjects and read the breadth requirements for your degree, and should discuss your choice with your student adviser, before deciding on your subjects.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
Bachelor of Engineering |
B-ENG Software Engineering stream |
Science credit subjects* for pre-2008 BSc, BASc and combined degree science courses
Science-credited subjects - new generation B-SCI and B-ENG. Core selective subjects for B-BMED.
Download PDF version.