Data Structures Algorithms In Python
AY2024/2025 Semester 1
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.
| 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 |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | ||||
|---|---|---|---|---|---|---|---|---|
| 930 | COMMON LEC (EELE) 0930-1050 Mon LT22 | 33075 TUT (EE03) 0930-1050 Wed TR+66 | ||||||
| 1000 | ||||||||
| 1030 | 33074 TUT (EE02) 1030-1150 Tue TR+69 | 33076 TUT (EE04) 1030-1150 Wed TR+64 | ||||||
| 1100 | ||||||||
| 1130 | ||||||||
| 1200 | ||||||||
| 1230 | ||||||||
| 1300 | ||||||||
| 1330 | 33073 TUT (EE01) 1330-1450 Mon TR+66 | |||||||
| 1400 | ||||||||
| 1430 | 33077 TUT (EE05) 1430-1550 Thu TR+64 | 33121 TUT (EE06) 1430-1550 Fri TR+61 | ||||||
| 1500 | ||||||||
| 1530 | ||||||||
| 1600 | ||||||||
| 1630 | 33122 TUT (EE07) 1630-1750 Fri TR+61 | |||||||
| 1700 | ||||||||
| 1730 | ||||||||
| 1800 | ||||||||
| 1830 | ||||||||
| 1900 | COMMON LEC (EPLE) 1900-2020 Tue LT22 | |||||||
| 1930 | ||||||||
| 2000 | ||||||||
| 2030 | 37604 TUT (EPT1) 2030-2150 Tue TR+63 | 37605 TUT (EPT2) 2030-2150 Tue TR+62 | 37609 TUT (EPT3) 2030-2150 Tue TR+64 | |||||
| 2100 | ||||||||
| 2130 | ||||||||