Note: This is an archived Handbook entry from 2012.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2012: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: 36 one-hour lectures (three per week) and 12 two-hour workshops (one per week) |
Total Time Commitment:
Study Period Commencement:
Semester 1, Semester 2
Achieving at least 75% in a programming competency test.
|Recommended Background Knowledge:|| |
|Non Allowed Subjects:||
433-172 Algorithmic Problem Solving
433 152-Algorithmic Problem Solving
|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
CoordinatorProf Alistair Moffat
Associate Professor Tim Baldwin
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:
To pass the subject, students must obtain at least 50% overall
|Prescribed Texts:|| |
|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|
On completion of this subject students should have the:
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.
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):||
Download PDF version.