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.
| Academic Units | 3 |
| Exam Schedule | Not Applicable |
| Grade Type | Letter Graded |
| Department Maintaining | CSC(CE) |
| Prerequisites | |
| Mutually Exclusive | |
| 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 | (Admyr 2021-onwards), |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|
0930
1030
1130
1230
1330
1430
1530
1630
1730
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...