Algorithm Design Analysis
AY2020/2021 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(CE) |
| Mutually Exclusive With | CE2001, CE2101, CZ2001 |
| Exam |
Available indexes
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 830 | COMMON LEC (CS2) 0830-0930 Mon LT10 | 10307 LAB (B1) 0830-1030 Wed HWLAB3 Odd Weeks | 10308 LAB (B2) 0830-1030 Wed HWLAB3 Even Weeks | |||
| 900 | ||||||
| 930 | 10307 TUT (B1) 0930-1030 Tue TR+17 Wk2-13 | 10308 TUT (B2) 0930-1030 Fri TR+18 Wk2-13 | ||||
| 1000 | ||||||
| 1030 | ||||||
| 1100 | ||||||
| 1130 | ||||||
| 1200 | ||||||
| 1230 | ||||||
| 1300 | ||||||
| 1330 | ||||||
| 1400 | ||||||
| 1430 | ||||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 | ||||||
| 1630 | COMMON LEC (CS2) 1630-1730 Wed LT10 | |||||
| 1700 | ||||||