| COURSE CODE | TITLE | AU | PROGRAMME/(DEPT MAINTAIN*) |
| ZZ0001 | EXAMPLE COURSE ONE | 3.0 | CSC(CE) |
| Prerequisite: | MH1812 & SC1007 OR | ||
| SC1007 & SC1124 | |||
| Mutually exclusive with: | CE2001, CE2101, CZ2001, CZ2101, SC2301 | ||
| Not available to Programme: | EEE, EEE 1, EEEC, EESJ, ENG(EEE), ENG(NULL), IEEC, IEM | ||
| Not available to all Programme with: | |||
| Not offered as Unrestricted Elective | |||
| This course aims to develop your knowledge, understanding and skills about example course one. Upon the successful completion of this course, students shall be able to (i) apply additional analysis techniques in complexity analysis of recursive algorithms; (ii) solve problems using a number of approaches like Divide-and-conquer, Greedy and Dynamic programming. Algorithms for sorting, graphs, the longest common subsequence, Knapsack, coin change and string matching are studied as examples. Students will also learn the concepts of complexity classes P & NP and apply greedy heuristic approach to solve NP-complete problems. | |||