Note: This is an archived Handbook entry from 2011.
|Dates & Locations:|| |
This subject is not offered in 2011.
|Time Commitment:||Contact Hours: 1 x 3 hour lecture per week |
Total Time Commitment: Not available
An undergraduate degree in a cognate discipline.
|Recommended Background Knowledge:||Basic proficienty in mathermatics and computing.|
|Non Allowed Subjects:|| |
433-253 Algorithms & Data Structures
|Core Participation Requirements:||
For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Students Experiencing
Dr Adrian Pearce
|Subject Overview:||Topics covered include complexity classes and asymptotic notations; empirical analysis of algorithms; abstract data types including queues, trees, heaps and graphs; algorithmic techniques including brute force, divide-and-conquer, dynamic programming and greedy approaches; space and time trade-offs; and the theoretical limits of algorithm power.|
On successful completion of this subject students should:
|Assessment:||Project work during semester expected to take approximately 36 hours (40%) and one written examination not exceeding 3-hours at the end of the semester (60%). Details of assessment components will be advised at the commencement of the subject. Both components must be completed satisfactorily to pass the subject.|
|Breadth Options:|| |
This subject is not available as a breadth subject.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
|Generic Skills:||On successful completion students should: |
Master of Engineering in Distributed Computing |
Master of Information Technology
Master of Operations Research and Management Science
Postgraduate Certificate in Engineering
Master of Engineering (Software) |
Download PDF version.