New: filter modules by day and time, student links, custom courses →
AY2019/2020 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 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 930 | 36031 LAB (LA05) 0930-1230 Tue S2.2-B4_04 Wk6,10 | |||||
| 1000 | ||||||
| 1030 | 36030 TUT (IT01) 1030-1230 Mon LHS-TR+32 | 36031 TUT (IT01) 1030-1230 Mon LHS-TR+32 | ||||
| 1100 | ||||||
| 1130 | ||||||
| 1200 | ||||||
| 1230 | ||||||
| 1300 | ||||||
| 1330 | 36030 LAB (IL01) 1330-1630 Tue S2.2-B4-04 Wk8,11 | |||||
| 1400 | ||||||
| 1430 | ||||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 | ||||||
