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 | CE |
Prerequisites | |
Mutually Exclusive | |
Not Available to Programme | BCE(2011-2019), BCG, CE(2011-2019), CEEC(2011-2019), CSC, CSEC, EEE, EEEC, IEEC, IEM, REP(CE)(2011-2018), REP(CSC) |
Not Available to All Programme | (Admyr 2021-onwards), |
Index | Type | Group | Day | Time | Venue | Remark |
---|---|---|---|---|---|---|
10411 | LEC/STUDIO | SCL2 | FRI | 1630-1820 | LT3 | Teaching Wk1-9,11-13 |
10411 | LEC/STUDIO | SCL2 | FRI | 1630-1820 | ONLINE | Teaching Wk10 |
10411 | TUT | SR2 | MON | 1530-1620 | TR+16 | Teaching Wk2-9,11-13 |
10411 | TUT | SR2 | MON | 1530-1620 | ONLINE | Teaching Wk10 |
10411 | LAB | SR2 | THU | 1430-1620 | SWLAB2 |
0930
1030
1130
1230
1330
1430
1530
1630
1730
CE1107
TUT | TR+16
Teaching Wk2-9,11-13
CE1107
TUT | ONLINE
Teaching Wk10
CE1107
LAB | SWLAB2
CE1107
LEC/STUDIO | LT3
Teaching Wk1-9,11-13
CE1107
LEC/STUDIO | ONLINE
Teaching Wk10
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...