Foundations of Algorithms

This subject has the following teaching availabilities in 2012:

On campus only

120 hours

OR

Achieving at least 75% in a programming competency test.

None

None

433-172 Algorithmic Problem Solving

433 152-Algorithmic Problem Solving

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

In many projects, it is important for programmers to have fine control over low-level details of program execution. This subject introduces students to a system programming language that gives programmers this kind of control, and shows how to apply standard algorithmic solutions to frequently encountered problems. Topics covered include: introduction to computer organization; machine level representation of data; programming in a system programming language; pointers and dynamic memory allocation; propositional logic; induction and recursion; basic searching algorithms (linear and binary); basic sorting algorithms (such as selection sort, insertion sort or quicksort); basic data structures (binary search trees and hash tables); asymptotic complexity; standard software development tools such as debuggers.

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

• Read, write and debug simple sorting and searching algorithms
• Read, write and debug code using standard data structures such as binary search trees and hash tables
• Present arguments for the correctness or incorrectness of a given algorithm
• Choose between different algorithms for simple problems by analysing their complexity
• Read, write and debug typical small scale programs in a system programming language such as C
• Use a command line interface for programming.

• Project work during semester, expected to take about 36 hours (30%)
• A mid-semester test (10%)
• A 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.

None

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

• Bachelor of Arts
• Bachelor of Commerce
• 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.

On completion of this subject students should have the:

• 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 through 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

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.