ModsCE2101
Algorithm Design Analysis
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 |
| Exam | 23 November 2024, 1.00 pm - 03.00 pm |
| Grade Type | N/A |
| Maintaining Dept | N/A |
| Prerequisites | |
| Mutually Exclusive With | CE2001, CZ2001, CZ2101, SC2001 |
| Not Available To Programme | BCG, CSC, CSEC, DSAI, EEE, EEEC, IEEC, IEM, MACS, REP(CSC) |
| Not Available To All Programme With | (Admyr 2021-onwards), |
| Not available as Core for programmes | N/A |
| Not Available as PE for programmes | N/A |
| Not Available as BDE/UEs for programmes | N/A |
| Not Offered To | N/A |
Total hours per week: 0 hrs
Available Indexes
No indexes available for this semester
(This might be an old module not longer offered in AY24/25)