New: filter modules by day and time, student links, custom courses →
AY2020/2021 Semester 1
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 |
| Categories | Core |
| Mutually Exclusive With | EE2008 |
| Exam |
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 930 | 36040 TUT (IT01) 0930-1130 Mon LHS-TR+32 | 36041 TUT (IT01) 0930-1130 Mon LHS-TR+32 | ||||
| 1000 | ||||||
| 1030 | 36040 LAB (IL01) 1030-1130 Tue ONLINE Wk8,11 | |||||
| 1100 | ||||||
| 1130 | 36041 LAB (EL05) 1130-1230 Tue ONLINE Wk7,12 | |||||
| 1200 | ||||||