Data Structures Algorithms In Python
AY2023/2024 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) |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 830 | COMMON LEC (EELE) 0830-0950 Mon LT22 | ||||
| 900 | |||||
| 930 | |||||
| 1000 | |||||
| 1030 | 36026 TUT (EE01) 1030-1150 Tue TR+69 | 36028 TUT (EE03) 1030-1150 Wed TR+64 | 36032 TUT (EE06) 1030-1150 Fri TR+64 | ||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | 36027 TUT (EE02) 1430-1550 Tue TR+64 | 36029 TUT (EE04) 1430-1550 Wed TR+66 | 36031 TUT (EE05) 1430-1550 Thu TR+64 | 36033 TUT (EE07) 1430-1550 Fri TR+90 | |
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 | |||||
| 1830 | |||||
| 1900 | COMMON LEC (EPLE) 1900-2020 Tue LT22 | ||||
| 1930 | |||||
| 2000 | |||||
| 2030 | 37557 TUT (EPT1) 2030-2150 Tue TR+61 | ||||
| 2100 | |||||
| 2130 |