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 |
| Grade Type | |
| Prerequisite | |
| Not Available To Programme | REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CSC), REP(CVEN), REP(ENE), REP(MAT), REP(ME) |
| Not Available To All Programme With | |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | SC5001 |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |