Algorithm Design Analysis
AY2022/2023 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 | |
|---|---|---|---|---|---|
| 930 | 10411 TUT (Z54) 0930-1020 Fri LHN-TR+20 Wk2-13 | ||||
| 1000 | |||||
| 1030 | 10411 LAB (Z54) 1030-1220 Fri HW2_1 Wk3,5,7,9,11,13 | ||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | 10406 TUT (A33) 1230-1320 Tue TR+16 Wk2-13 | 10407 TUT (A41) 1230-1320 Wed TR+7 Wk2-13 | |||
| 1300 | |||||
| 1330 | 10404 TUT (A26) 1330-1420 Mon TR+22 Wk2-13 | ||||
| 1400 | |||||
| 1430 | 10404 LAB (A26) 1430-1620 Mon HW2_1 Wk3,5,7,9,11,13 | 10406 LAB (A33) 1430-1620 Tue HW2_1 Even Weeks | 10407 LAB (A41) 1430-1620 Wed HW2_1 Even Weeks | ||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | COMMON LEC (L1) 1630-1720 Mon LT2A | COMMON LEC (L1) 1630-1720 Wed LT19 | |||
| 1700 |