Area: |
Department of Computing |
Credits: |
25.0 |
Contact Hours: |
3.0 |
| |
| ** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. ** |
| |
Lecture: |
1 x 2 Hours Weekly |
Tutorial: |
1 x 1 Hours Weekly |
Prerequisite(s): |
1922 (v.6) Software Technology 152 or any previous version
|
| |
Syllabus: |
Maths revision and Big-O. Divide and Conquer. Quick-sort and Mergesort. Priority Queues - Heaps and Leftist Trees. Sorting. Graphs-DFS and BFS. PQs and Heapsort. Greedy Algorithms - MCST and Shortest Path. Data Compression. String Searching. Dynamic Programming. Matrix chain. LCS. Parallel and Distributed Algorithms. |
| |
| ** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. ** |
| |
Field of Education: |
31300 Electrical and Electronic Engineering and Technology (Narrow Grouping) |
HECS Band (if applicable): |
2 |
|
Extent to which this unit or thesis
utilises online information: |
Informational |
Result Type: |
Grade/Mark |
|
Availability |
| Year |
Location |
Period |
Internal |
Area External |
Central External |
| 2004 |
Bentley Campus |
Semester 1 |
Y |
|
|
Area
External |
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research. |
Central
External | refers to external course/units run through the Curtin Bentley-based Distance Education Area |
|
