Area: | Department of Computing |
Contact Hours: | 3.0 |
Credits: | 25.0 |
Lecture: | 1 x 2 Hours Weekly |
Tutorial: | 1 x 1 Hours Weekly |
Prerequisite(s): | 1922 (v.6) Software Technology 152 or any previous version
|
| 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 Graphs. Data Compression. String Searching. Dynamic Programming. Matrix chain. LCS. Parallel and Distributed Algorithms. Knapsack |
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 |
|
