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) 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.
| AUs | 3.0 AUs |
| Grade Type | |
| Prerequisite | MH1812, SC1007, SC1124 |
| Not Available To Programme | EEE, EEE 1, EEEC, ENG(EEE), ENG(NULL), IEEC, IEM |
| Not Available To All Programme With | (Admyr 2011-2020), |
| 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, CZ2101, SC2301 |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | Yes |
| Exam |
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
Other Relevant Mods
SC1003
Introduction To Computational Thinking & Programming
SC1004
Linear Algebra For Computing
SC1005
Digital Logic
SC1006
Computer Organisation & Architecture
SC1007
Data Structures & Algorithms
SC1008
C & C++ Programming
SC1104
Linear Algebra For Computing
SC1124
Math 2: Discrete Structures For Computing
SC1302
Ethics