ALGORITHM DESIGN AND ANALYSIS (4 SCU)

Learning Outcomes:

Upon successful completion of this course, students are expected to be able to apply basic techniques to analyse the performance of algorithms; explain the most important algorithms used in various common computer science applications; apply efficient algorithm design techniques and understand the limitations of algorithms.

Topics:

The course provides students with fundamental techniques for analysing and designing algorithms. Concepts of efficiency and computational complexity are introduced and the basic data structures commonly utilized in designing algorithms such as lists, trees and graphs are reviewed. Measures of complexity using asymptotic analysis and recurrence relations are introduced as an analytical tool. Algorithm design techniques such as the greedy strategy, divide-and-conquer, dynamic programming, and graph searching are covered.

Prerequisite(s): Algorithm and Programming