12333 (v.4) Design and Analysis of Algorithms 251
| 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 |
| Year | Location | Period | Internal | Area External | Central External | | 2003 | Bentley Campus | Semester 1 | Y | | | | 2003 | Miri Sarawak Campus | Semester 2 | Y | | | |
Current as of: October 30, 2003 13:11:55
CRICOS provider code 00301J
