New: filter modules by day and time, student links, custom courses →
AY2019/2020 Semester 2
This course aims to give a systematic introduction to data structures and algorithms for constructing efficient computer programs. Emphasis is on data abstraction issues in program development process, and on the design of efficient algorithms. Simple algorithmic paradigms such as greedy algorithms, divide-and-conquer algorithms and dynamic programming will be introduced. Elementary analyses of algorithmic complexities will also be taught. Contents: Introduction. Principles of algorithm analysis. Data structures. Search Trees. Sorting. Searching. Algorithm design techniques.
| AUs | 4.0 AUs |
| Categories | Core |
| Not Available To Programme | REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CSC), REP(CVEN), REP(ENE), REP(MAT), REP(ME) |
| Mutually Exclusive With | IM1001 |
| Exam |
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1030 | 32191 TUT (SD01) 1030-1230 Mon TR121 | ||||
| 1100 | |||||
| 1130 | |||||
| 1200 |
