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) apply, design and analyse algorithms using a number of approaches to solve various problems like sorting, shortest-path, minimum spanning tree, optimal sequencing for matrix multiplication, the longest common subsequence, string matching. 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 | Not Applicable |
| Grade Type | Letter Graded |
| Department Maintaining | CSC(CE) |
| Prerequisites | Must be a Turing AI Scholar SC1303 |
| Mutually Exclusive |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|---|---|---|---|---|---|
| 10931 | SEM | FTAI | WED | 1330-1620 | ONLINE | Teaching Wk3 |
| 10931 | SEM | FTAI | WED | 1330-1620 | TAISPSPACE | Teaching Wk1,2,4-13 |
0930
1030
1130
1230
1330
1430
1530
1630
1730
SC2301
SEM | ONLINE
Teaching Wk3
SC2301
SEM | TAISPSPACE
Teaching Wk1,2,4-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): ...