COMP3005 Design and Analysis of Algorithms (3 units)
- Medium of Instruction:
This course is to introduce the techniques of designing efficient algorithms including divide-and-conquer strategy, dynamic programming, greedy and approximate algorithms, and so forth, and the applications of these techniques to design non-trivial algorithms, e.g. advanced data structures, graph algorithms, sorting algorithms and computational geometry. The time and space complexity of algorithms will be analysed from a theoretical point of view. Also, the issue of problem complexity will be addressed.
No result found.