Algorithms and Data Structures

This subject has the following teaching availabilities in 2012:

120 hours

25 points of university-level Mathematics, AND one of the following:

Please Note: A mark of 80 or more must be obtained in COMP20005 Engineering Computation.

None

None

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/

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:

• Present arguments for the correctness or incorrectness of a given algorithm
• Reason about the behaviour of a given algorithm
• Evaluate the asymptotic running time of fundamental algorithms
• Apply knowledge of basic science and engineering fundamentals
• Choose appropriate data structures and algorithms for a given problem; and
• Implement the chosen data structures and algorithms

• Project work during semester expected to take about 36 hours (30%)
• A mid-semester test (10%)
• And a 3 hour end-of-semester examination that includes a practical programming component (60%)

To pass the subject, students must obtain at least:

• 50% overall, 15/30 in project work
• And 35/70 in the mid-semester test and end-of-semester examination combined

TBA

This subject potentially can be taken as a breadth subject component for the following courses:

• Bachelor of Arts
• Bachelor of Commerce
• Bachelor of Environments
• Bachelor of Music

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.