CSI3108 Algorithm Analysis
Students learn typical problems in Computer Science and how to solve them efficiently with various algorithmic tools, such as divide-and-conquer methods, greedy methods, dynamic programming, linear programming, and approximation. The course also deals with NP-Complete problems and Quantum algorithms. Prerequisites of the course are Data Structures, Practices in Data Structures and Discrete Mathematics.