Algorithm Design Analysis
AY2024/2025 Semester 1
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 | |
|---|---|---|---|---|---|
| 930 | 10507 TUT (SCE2) 0930-1020 Mon TR+6 Wk2-13 | ||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | 10507 LAB (SCE2) 1230-1420 Thu HWLAB2 Odd Weeks | ||||
| 1300 | |||||
| 1330 | COMMON LEC (SCL2) 1330-1420 Mon ONLINE | ||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | COMMON LEC (SCL2) 1630-1720 Fri ONLINE | ||||
| 1700 | |||||
| 1730 | |||||
| 1800 | |||||
| 1830 | COMMON LEC (CSPT2) 1830-1920 Tue LT10 | ||||
| 1900 | |||||
| 1930 | 14509 TUT (CSPT2) 1930-2020 Tue LT10 Wk2-13 | ||||
| 2000 | |||||
| 2030 | 14509 LAB (CSPT2) 2030-2120 Tue LT10 Wk2-13 | ||||
| 2100 |