Note: This is an archived Handbook entry from 2010.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2010:Semester 1, Parkville - Taught on campus.
Semester 2, Parkville - Taught on campus.
On campus only
Timetable can be viewed here. For information about these dates, click here.
|Time Commitment:||Contact Hours: 2 one-hour lectures; 1 two-hour workshop (per week) |
Total Time Commitment: 120 hours
|Prerequisites:||COMP20006 Programming the Machine AND 25 points of first-year mathematics.|
|Recommended Background Knowledge:||None|
|Non Allowed Subjects:||433-253 Algorithms and Data Structures; COMP20001 Algorithms and Data Structures.|
|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 Description, Subject Objectives, Generic Skills and Assessment Requirements of this entry.The University is dedicated to provide support to those with special requirements. Further details on the Disability support scheme can be found at the Disability Liaison Unit Website:http://www.services.unimelb.edu.au/disability/|
CoordinatorDr Anthony Wirth, Dr Udaya Parampalli
Engineering Student Centre
Melbourne School of Engineering Office
Building 173, Grattan Street
The University of Melbourne
VIC 3010 Australia
General telephone enquiries
+ 61 3 8344 6703
+ 61 3 8344 6507
+ 61 3 9349 2182
+ 61 3 8344 7707
|Subject Overview:||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.|
|Objectives:||On successful completion of the subject students should be able to: |
Project work during semester
|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|
|Generic Skills:||On completion of this subject students should have the: |
This subject is offered for the first time in Semester 2, 2009 and replaces COMP20001 of the same name.This subject is available for science credit to students enrolled in the BSc (both pre-2008 and new degrees), BASc or a combined BSc course.
Students undertaking this subject will be expected to regularly access an internet-enabled computer.
This subject is available as breadth, for the following Bachelor courses; Arts, Commerce, Environments and Music.
Bachelor of Engineering |
Bachelor of Engineering (Computer Engineering)/Bachelor of Science
Bachelor of Engineering (Computer) and Bachelor of Arts
Bachelor of Engineering (Electrical Engineering)/Bachelor of Science
Bachelor of Engineering (Mechatronics) and Bachelor of Computer Science
Bachelor of Science
Download PDF version.