New: filter modules by day and time, student links, custom courses →
AY2020/2021 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 | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 900 | 33028 TUT (EE08) 0900-1100 Fri TR+61 | ||||
| 930 | |||||
| 1000 | |||||
| 1030 | 33021 TUT (EE01) 1030-1230 Mon TR+63 | 33023 TUT (EE03) 1030-1230 Tue TR+77 | 33026 TUT (EE06) 1030-1230 Wed TR+78 | 33027 TUT (EE07) 1030-1230 Thu TR+67 | |
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | 33022 TUT (EE02) 1330-1530 Mon TR+68 | 33024 TUT (EE04) 1330-1530 Tue TR+77 | |||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | 33025 TUT (EE05) 1530-1730 Tue TR+93 | ||||
| 1600 | |||||
| 1630 | |||||
| 1700 |
