Design and Analysis
of Algorithms

Course

Course description

Design and Analysis of Algorithms is an important course that bridges students to a number of advanced courses in data science and analytics. This course introduces core data structures and algorithms. It covers advanced asymptotic complexity analysis, introduces common algorithmic paradigms (e.g., divide-and-conquer, greedy, and dynamic programming), a collection of classic algorithms (e.g., graph algorithms) and introduces the computational complexity theory. The course employs a range of assessment methods, including individual projects, coding exercises and closed-book exams, to foster both theoretical and practical foundation.