Not offered in the current semester · Last offered AY2025/2026 Semester 1
This course aims to (i) teach the concepts, implementations and applications of data structures such as arrays, linked lists, stacks, queues and trees that are important for building efficient algorithms; (ii) provide an introduction to algorithm analysis and design. These are essential for future computer science and computer engineering courses.
| AUs | 3.0 AUs |
| Grade Type | |
| Prerequisite | CE1103, CZ1103, CE1003, CZ1003 |
| Not Available To Programme | BCE, BCG(2011-2019), CE, CEEC, CSC(2011-2019), CSEC(2011-2019), DSAI(2019), EEE, EEEC, IEEC, IEM, MACS(2019), REP(ASEN), REP(BIE), REP(CBE), REP(CE), REP(CSC)(2011-2018), REP(CVEN), REP(EEE), REP(ENE), REP(MAT), REP(ME) |
| Not Available To All Programme With | (Admyr 2021-onwards), |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | CE1007, CE1107, CZ1007, SC1007 |
| Not Offered As BDE | Yes |
| Not Offered As Unrestricted Elective | |
| Exam |
Total hours per week: 8 hrs
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 |
Other offerings
AY24/25
AY23/24
AY22/23
AY21/22
AY20/21