Algorithm Design Analysis
AY2024/2025 Semester 2
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.
| AUs | 3.0 AUs |
| Categories | CoreMinorsBDE |
| Not Available To Programme | BCE, BCG(2011-2019), CE, CEEC, CSC(2011-2019), CSEC(2011-2019), DSAI(2011-2019), EEE, EEEC, IEEC, IEM, MACS(2011-2019), REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CVEN), REP(EEE), REP(ENE), REP(MAT), REP(ME) |
| Not Available To All Programme With | (Admyr 2021-onwards), |
| Mutually Exclusive With | CE2001, CE2101, CZ2001, SC2001 |
| Exam |
Available indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1230 | COMMON LEC (SCL2) 1230-1320 Tue LT2A, ONLINE Wk1,2,4-13, Teaching Wk3 | 10975 LAB (REP2) 1230-1420 Thu HWLAB3 Even Weeks | 10975 TUT (REP2) 1230-1320 Fri TR+8, ONLINE Wk2,4-13, Teaching Wk3 | ||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | COMMON LEC (SCL2) 1430-1520 Thu ONLINE, LT2A Wk3, Teaching Wk1,2,4-13 | ||||
| 1500 |