Courses Offered

COMP3251 Algorithm design

COMP3251 Algorithm design

2022-23
Instructor(s):Huang Z.Y.
(Class A) No. of credit(s):6
Recommended Learning Hours:
Pre-requisite(s):COMP2119
Co-requisite(s):  
Mutually exclusive with:COMP3250 or COMP3252
Remarks:

Course Learning Outcomes

Mapping from Course Learning Outcomes to Programme Learning Outcomes
 PLO aPLO bPLO cPLO dPLO ePLO fPLO gPLO hPLO iPLO j

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

Syllabus

Calendar Entry:
The course introduces various algorithm design techniques, including divide and conquer, greedy, and dynamic programming, and studies selected topics on graph algorithms. These techniques can be used to design better algorithms in various areas of computer science. The course also gives an overview of NP-complete problems.

Detailed Description:

Assessment:
Continuous Assessment: 50%
Written Examination: 50%

Teaching Plan

Please refer to the corresponding Moodle course.

Moodle Course(s)

Please login with your CS account (for staff only)