Course Information
COMP3250 Design and Analysis of Algorithms

COMP3250 Design and Analysis of Algorithms

2017-18
Instructor(s):Huang Z.Y.
(Class A) No. of credit(s):6
Lam T W
(Class B)
Recommended Learning Hours:
Lecture: 39.0
Pre-requisite(s):COMP2119 or CSIS1119 or ELEC1502 or ELEC1503 or ELEC2543
Co-requisite(s):  
Mutually exclusive with:  
Remarks:

Course Learning Outcomes

1. [Basic algorithm design technique]
Understand basic techniques for designing algorithms, including the techniques of recursion, divide-and-conquer, and greedy.
2. [Advanced algorithm design technique]
Understand advanced techniques for designing algorithms, including dynamic programming, network flow and problem reduction.
3. [Correctness and time complexity]
Understand the techniques of proof by contradiction, mathematical induction and recurrence relation, and apply them to prove the correctness and to analyze the running time of algorithms.
4. [Intractability]
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know many practically important problems that do not admit any efficient algorithms.
5. [Program solving]
Able to apply the algorithm design techniques to design efficient algorithms for different kinds of problems
Mapping from Course Learning Outcomes to Programme Learning Outcomes
 PLO aPLO bPLO cPLO dPLO ePLO fPLO gPLO hPLO iPLO j
CLO 1T,P
CLO 2T,P
CLO 3T,PT,P
CLO 4T,PT,P
CLO 5T,P

T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to here.

Syllabus

Calendar Entry:
The course studies various algorithm design techniques, such as divide and conquer, and dynamic programming. These techniques are applied to design novel algorithms from various areas of computer science. Topics include: advanced data structures; graph algorithms; searching algorithms; gemometric algorithms; overview of NP-complete problems.

Detailed Description:

Basic algorithm design technique Mapped to CLOs
Divide and Conquer1, 3, 5
Greedy algorithms1, 3, 5
Graph algorithms1, 3, 5
Advanced algorithm design technique Mapped to CLOs
Dynamic programming2, 3, 5
Network flow2, 3, 5
Intractability Mapped to CLOs
Problem reduction and NP-completeness2, 3, 4, 5
Approximation Algorithms3, 4, 5

Assessment:
Continuous Assessment: 50%
Continuous Assessment: 50%

Teaching Plan

Please refer to the corresponding Moodle course.

Moodle Course(s)

COMP3250A
COMP3250B