Design of Algorithms

Subject COMP20007 (2013)

Note: This is an archived Handbook entry from 2013.

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

This subject is not offered in 2013.

Time Commitment: Contact Hours: 48 hours, comprising of two 1-hour lectures and one 2-hour workshop per week
Total Time Commitment:

120 hours

Prerequisites:

25 points of university-level Mathematics

AND

Subject
Study Period Commencement:
Credit Points:
Not offered in 2013
12.50
Not offered in 2013
12.50
Corequisites:

None

Recommended Background Knowledge:

None

Non Allowed Subjects:
Subject

433-253 Algorithms and Data Structures

433 298 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

Contact

email: aturpin@unimelb.edu.au

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.

Objectives:

On completion of this subject, students should be able to:

  • Read, write and debug graph algorithms, advanced sorting algorithms, dynamic programs and greedy algorithms
  • Read, write and debug code using intermediate data structures
  • Choose between different algorithms for intermediate problems by analysing their complexity
  • Read, write and debug typical multi-module programs in a system programming language such as C

Assessment:
  • A two stage project work during semester, expected to take about 36 hours with the first stage due in week 4 and the second stage due in week 10 (30%)
  • One mid-semester test (10%)
  • One 3-hour end-of-semester written examination (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 written examination combined.
  • ILO1-ILO4 are addressed through the projects and in workshops. ILO1-ILO3 are assessed in the mid-semester test and the final exam.
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:

  • An ability to apply knowledge of basic science and engineering fundamentals
  • An ability to undertake problem identification, formulation and solution
  • The capacity to solve problems, including the collection and evaluation of information
  • The capacity for critical and independent thought and reflection
  • An expectation of the need to undertake lifelong learning, and the capacity to do so

Related Majors/Minors/Specialisations: Computer Science
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.
Related Breadth Track(s): Computing

Download PDF version.