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. 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 | 36042 LAB (IL01) 0930-1230 Tue S2.2-B4-04 Wk8,10 | 36041 TUT (IT01) 0930-1130 Tue TR121 | 36043 TUT (IT01) 0930-1130 Tue TR121 | 36042 TUT (IT02) 0930-1130 Wed TR+61 | 36044 TUT (IT02) 0930-1130 Wed TR+61 | 36043 LAB (IL03) 0930-1230 Fri S2.2-B4-04 Wk6,9 | 36044 LAB (IL03) 0930-1230 Fri S2.2-B4-04 Wk6,9 | ||
| 1000 | |||||||||
| 1030 | |||||||||
| 1100 | |||||||||
| 1130 | |||||||||
| 1200 | |||||||||
| 1230 | |||||||||
| 1300 | |||||||||
| 1330 | 36041 LAB (IL02) 1330-1630 Tue S2.2-B4-04 Wk7,11 | ||||||||
| 1400 | |||||||||
| 1430 | |||||||||
| 1500 | |||||||||
| 1530 | |||||||||
| 1600 | |||||||||
