This course aims to give a systematic introduction to data structures and algorithms for constructing efficient computer programs based on Python. Principles of algorithmic analysis will be studied. Emphasis is on data structures and efficient algorithms in the program development process, covering abstract data types, trees, graphs, sorting, and searching. The greedy technique such as Kruskal's algorithm and Dijkstra's algorithm will be introduced. AI algorithms such as classification will also be discussed. Theories will be practiced during tutorial sessions and students will gain substantial Python programming experience.
| Academic Units | 3 |
| Exam Schedule | Wed Apr 29 2026 00:00:00 GMT+0000 (Coordinated Universal Time) 13:00-15:00 |
| Grade Type | Letter Graded |
| Department Maintaining | EEE |
| Mutually Exclusive | |
| Not Available to Programme | REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CSC), REP(CVEN), REP(ENE), REP(MAT), REP(ME) |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|---|---|---|---|---|---|
| - | LEC/STUDIO | EELE | MON | 1630-1750 | LKC-LT |
0930
1030
1130
1230
1330
1430
1530
1630
1730
IE2108
LEC/STUDIO | LKC-LT
IE2108
34101
TUT | TR+67
IE2108
34103
TUT | TR+67
IE2108
34105
TUT | TR+67
IE2108
34102
TUT | TR+68
IE2108
34104
TUT | TR+68
IE2108
34106
TUT | TR+91
IE2108
34109
TUT | TR+69
IE2108
34107
TUT | TR+90
IE2108
34110
TUT | TR+66
IE2108
34108
TUT | TR+94
IE2108
34111
TUT | TR+68
IE2108
34113
TUT | TR+67
IE2108
34112
TUT | TR+89
IE2108
34114
TUT | TR+68
IE2108
34115
TUT | TR+88
IE2108
34117
TUT | TR+89
IE2108
34116
TUT | TR+89
IE2108
34118
TUT | TR+90
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...