AY2026 Semester 1 data is now available →
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. Course content: Introduction. Principles of Algorithm Analysis. Data Structures. Search Trees. Sorting. Searching. Algorithm Design Techniques.
| AUs | 4.0 AUs |
| Grade Type | |
| Prerequisite | |
| Not Available To Programme | |
| Not Available To All Programme With | |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | EE2008 |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Required first
Data Structures & Algorithms
| 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 | ||
|---|---|---|---|---|---|---|
| 930 | 36070 TUT (EE34) 0930-1050 Fri TR+77 | 36072 TUT (EE34) 0930-1050 Fri TR+77 | ||||
| 1000 | ||||||
| 1030 | ||||||
| 1100 | ||||||
| 1130 | ||||||
| 1200 | ||||||
| 1230 | ||||||
| 1300 | ||||||
| 1330 | 36070 LAB (EL43) 1330-1620 Fri S2-B4C-17. Wk8,12 | 36072 LAB (EL39) 1330-1620 Fri S2-B4C-17. Wk6,10 | ||||
| 1400 | ||||||
| 1430 | ||||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 | ||||||
