This course aims to develop your knowledge, understanding and skills about algorithm design and analysis. Upon the successful completion of this course, students shall be able to (i) apply additional analysis techniques in complexity analysis of recursive algorithms; (ii) solve problems using a number of approaches like Divide-and-conquer, Greedy and Dynamic programming. Algorithms for sorting, graphs, the longest common subsequence, Knapsack, coin change and string matching are studied as examples. Students will also learn the concepts of complexity classes P & NP and apply greedy heuristic approach to solve NP-complete problems.
| Academic Units | 3 |
| Exam Schedule | Tue Apr 28 2026 00:00:00 GMT+0000 (Coordinated Universal Time) 09:00-11:00 |
| Grade Type | Letter Graded |
| Department Maintaining | CSC(CE) |
| Prerequisites | |
| Mutually Exclusive | |
| Not Available to Programme | EEE, EEE 1, EEEC, ENG(EEE), ENG(NULL), IEEC, IEM |
| Not Available to All Programme | (Admyr 2011-2020), |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|---|---|---|---|---|---|
| - | LEC/STUDIO | SCL2 | TUE | 1230-1320 | LT3 | |
| LEC/STUDIO | SCL2 | THU | 1430-1520 | LT4 |
0930
1030
1130
1230
1330
1430
1530
1630
1730
SC2001
10253
TUT | TR+17
Teaching Wk2-13
SC2001
10257
TUT | TR+16
Teaching Wk2-13
SC2001
LEC/STUDIO | LT3
SC2001
10258
TUT | TR+5
Teaching Wk2-13
SC2001
10254
LAB | HWLAB1
Teaching Wk1,3,5,7,9,11,13
SC2001
10253
LAB | HWLAB3
Teaching Wk2,4,6,8,10,12
SC2001
10254
TUT | TR+7
Teaching Wk2-13
SC2001
10255
LAB | HWLAB3
Teaching Wk1,3,5,7,9,11,13
SC2001
10256
LAB | HPL
Teaching Wk2,4,6,8,10,12
SC2001
10257
LAB | HWLAB3
Teaching Wk1,3,5,7,9,11,13
SC2001
LEC/STUDIO | LT4
SC2001
10258
LAB | HWLAB3
Teaching Wk2,4,6,8,10,12
SC2001
10256
TUT | TR+8
Teaching Wk2-13
SC2001
10255
TUT | TR+5
Teaching Wk2-13
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...