DESIGN AND ANALYSIS OF ALGORITHMS
2010/2011, Semester 1
School of Computing (Computer Science)
Modular Credits: 4
To learn some basic techniques in algorithmic design and to learn analysis of correctness and complexity of algorithms.
(CS2010 or its equivalent) and (CS1231 or MA1100)
Lecture and Tutorial
This module introduces different techniques of designing and analysing
algorithms. Students will learn about the framework for algorithm analysis,
for example, low bound arguments, average case analysis, and the
theory of NP-completeness. In addition students are exposed to various
algorithm design paradigms. The module serves two purposes: to improve
the students' ability to design algorithms in different areas, and to prepare
students for the study of more advanced algorithms. The module covers
lower and upper bounds, recurrences, basic algorithm paradigms
(such as divide and conquer, greedy algorithms, dynamic programming),
NP-completeness and some selected advanced topics.
1 Midterm (15 Oct (Friday) 6 PM)
EEE and CPE students can only take this module as a technical elective to satisfy the program requirements or UEM but not CFM/ULR-Breadth.