Data Structures Algorithms in Python
AY2026/2027 Semester 1
This course aims to give a systematic introduction to data structures and algorithms for constructing efficient computer programs, including the principles of algorithmic analysis and algorithmic design. The emphasis is on efficient data structures and algorithms, covering searching, sorting, abstract data types, stacks, queues, binary search trees, graphs, and simple graph algorithms including greedy algorithms such as Dijkstra's algorithm and Kruskal's algorithm. The course uses the Python programming language. Tutorials will cover both theory and practical applications, and students will gain substantial programming experience.
| AUs | 3.0 AUs |
| Categories | Core |
| Not Available To Programme | REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CSC), REP(CVEN), REP(ENE), REP(MAT), REP(ME) |
| Mutually Exclusive With | SC5001 |
| Exam | 2 December 2026, 1.00 pm - 3.00 pm |
Available indexes
| Mon | Tue | Wed | Thu | Fri | |||
|---|---|---|---|---|---|---|---|
| 930 | COMMON LEC (EELE) 0930-1050 Mon LT24 | 32264 TUT (EE04) 0930-1050 Wed TR+66 | |||||
| 1000 | |||||||
| 1030 | 32262 TUT (EE02) 1030-1150 Tue TR+69 | 32265 TUT (EE05) 1030-1150 Wed TR+64 | 32266 TUT (EE06) 1030-1150 Thu TR+61 | ||||
| 1100 | |||||||
| 1130 | |||||||
| 1200 | |||||||
| 1230 | |||||||
| 1300 | |||||||
| 1330 | 32261 TUT (EE01) 1330-1450 Mon TR+78 | ||||||
| 1400 | |||||||
| 1430 | 32263 TUT (EE03) 1430-1550 Tue TR+90 | 32267 TUT (EE07) 1430-1550 Thu TR+64 | 32268 TUT (EE08) 1430-1550 Fri TR+61 | ||||
| 1500 | |||||||
| 1530 | |||||||
| 1600 | |||||||
| 1630 | 32269 TUT (EE09) 1630-1750 Fri TR+61 | ||||||
| 1700 | |||||||
| 1730 | |||||||
| 1800 | |||||||
| 1830 | |||||||
| 1900 | COMMON LEC (EPLE) 1900-2020 Tue LT22 | ||||||
| 1930 | |||||||
| 2000 | |||||||
| 2030 | 37527 TUT (EPT1) 2030-2150 Tue TR+63 | 37528 TUT (EPT2) 2030-2150 Tue TR+62 | |||||
| 2100 | |||||||
| 2130 | |||||||