Algorithms and Data Structures

Subject 433-298 (2009)

Note: This is an archived Handbook entry from 2009. Search for this in the current handbook

Credit Points: 12.50
Level: 2 (Undergraduate)
Dates & Locations:

This subject has the following teaching availabilities in 2009:

Semester 2, - Taught on campus.
Pre-teaching Period Start not applicable
Teaching Period not applicable
Assessment Period End not applicable
Last date to Self-Enrol not applicable
Census Date not applicable
Last date to Withdraw without fail not applicable

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.
Corequisites: None
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 Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, 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 Student Equity and Disability Support: http://services.unimelb.edu.au/disability

Coordinator

Dr Anthony Ian Wirth
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:
  • 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.
Assessment: 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.
Prescribed Texts: None
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 developed the following generic skills:
- ability to apply knowledge of basic science and engineering fundamentals;
- in-depth technical competence in at least one engineering discipline;
- ability to undertake problem identification, formulation and solution.
Notes:

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.
Related Course(s): Bachelor of Engineering

Download PDF version.