Not offered in the current semester · Last offered AY2025/2026 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 |
| Grade Type | |
| Prerequisite | CZ1107, MH1812 |
| 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), |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | CE2001, CE2101, CZ2001, SC2001 |
| Not Offered As BDE | Yes |
| Not Offered As Unrestricted Elective | |
| Exam |
Total hours per week: 6 hrs
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
Other offerings
AY24/25
AY23/24
AY22/23
AY21/22
AY20/21