New: filter modules by day and time, student links, custom courses →
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.
Algorithm Design & Analysis
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 1230 | COMMON LEC (SCL2) 1230-1420 Mon ONLINE | 10419 LAB (SCSG) 1230-1420 Wed HWLAB2 Even Weeks | ||||
| 1300 | ||||||
| 1330 | ||||||
| 1400 | ||||||
| 1430 | ||||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 | ||||||
| 1630 | 10419 TUT (SCSG) 1630-1720 Wed TR+17, ONLINE Wk2-9,11-13, Teaching Wk10 | 10419 TUT (SCSG) 1630-1720 Wed TR+17, ONLINE Wk2-9,11-13, Teaching Wk10 | ||||
| 1700 | ||||||