Data Structures Algorithms
AY2022/2023 Semester 2
This course aims to give a systematic introduction to data structures and algorithms for constructing efficient computer programs. 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 Prim's algorithm, Kruskal's algorithm, and Dijkstra's algorithm will be introduced.
| 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 | |
|---|---|---|---|---|---|
| 930 | 32164 TUT (EE09) 0930-1050 Fri TR+67 | ||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | 32156 TUT (EE01) 1130-1250 Mon TR+66 | 32160 TUT (EE05) 1130-1250 Wed TR+65 | 32165 TUT (EE10) 1130-1250 Fri TR+78 | ||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | 32158 TUT (EE03) 1330-1450 Tue TR+88 | 32162 TUT (EE07) 1330-1450 Thu TR+91 | |||
| 1400 | |||||
| 1430 | 32161 TUT (EE06) 1430-1550 Wed TR+66 | ||||
| 1500 | |||||
| 1530 | 32157 TUT (EE02) 1530-1650 Mon TR+88 | 32159 TUT (EE04) 1530-1650 Tue TR+89 | 32163 TUT (EE08) 1530-1650 Thu TR+89 | ||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 | |||||
| 1830 | |||||
| 1900 | 37574 LAB (EPL1) 1900-2150 Mon S2-B4C-17 Wk5,8 | 37574 TUT (EPT1) 1900-2020 Wed TR+64 | |||
| 1930 | |||||
| 2000 | |||||
| 2030 | |||||
| 2100 | |||||
| 2130 |