Courses Offered

COMP3252 Algorithm design and analysis

COMP3252 Algorithm design and analysis

2022-23
Instructor(s):Lam T W
(Class A) No. of credit(s):6
Recommended Learning Hours:
Pre-requisite(s):COMP2119
Co-requisite(s):  
Mutually exclusive with:COMP3250 or COMP3251
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 studies principles of algorithm design and the analysis of sophisticated algorithms (regarding proof of correctness and time complexity). Topics include divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, network flow, geometric algorithms, and NP-completeness. The course puts emphasis on mathematical rigor; it expects students to figure out the mathematics and logic that make algorithms work. Students can form pairs to discuss the assignments and are required to write rigorous proofs of correctness and analysis independently.

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)