12333 (v.4) Design and Analysis of Algorithms 251
| Area: | Department of Computing |
| Credits: | 25.0 |
| Contact Hours: | 3.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
|
| 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 Graphs. Data Compression. String Searching. Dynamic Programming. Matrix chain. LCS. Parallel and Distributed Algorithms. Knapsack |
| |
| Unit Outcomes: | On successful completion of this unit, the student will be able to cast problems in algorithmic terms, identify efficient algorithms to solve problems, construct their own algorithms to solve problems and analyse algorithms to determine resource requirements. |
| Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information. |
| Unit References: | Sahni, S., 2000, 'Data Structures, Algorithms, and Applications in Java', McGraw-Hill, Cambridge. |
| Unit Texts: | Corman, T. H. et al, 2001, 'Introduction to Algorithms', MIT Press, Cambridge. |
| |
| Unit Assessment Breakdown: | Test One 15%. Test Two 15%. Assignment 15%. Final examination 55%. To pass this unit students must achieve 50% in the exam and 50% overall. |
| Year | Location | Period | Internal | Area External | Central External | | 2004 | Bentley Campus | Semester 1 | Y | | | |
Current as of: February 2, 2004
CRICOS provider code 00301J
