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 | EEE, EEEC, ENG(EEE), ENG(NULL), IEEC, IEM |
Not Available to All Programme | (Admyr 2011-2020), |
Index | Type | Group | Day | Time | Venue | Remark |
---|---|---|---|---|---|---|
- | LEC/STUDIO | SCL2 | FRI | 1630-1820 | ONLINE | Teaching Wk10 |
LEC/STUDIO | SCL2 | FRI | 1630-1820 | LT3 | Teaching Wk1-9,11-13 |
0930
1030
1130
1230
1330
1430
1530
1630
1730
SC1007
10097
TUT | ONLINE
Teaching Wk10
SC1007
10099
TUT | ONLINE
Teaching Wk10
SC1007
10097
TUT | TR+9
Teaching Wk2-9,11-13
SC1007
10099
TUT | TR+16
Teaching Wk2-9,11-13
SC1007
10620
TUT | ONLINE
Teaching Wk10
SC1007
10620
TUT | TR+31
Teaching Wk2-9,11-13
SC1007
10097
LAB | SPL
SC1007
10098
LAB | SPL
SC1007
10099
LAB | SWLAB2
SC1007
10098
TUT | ONLINE
Teaching Wk10
SC1007
10620
LAB | SPL
SC1007
LEC/STUDIO | ONLINE
Teaching Wk10
SC1007
10098
TUT | TR+8
Teaching Wk2-9,11-13
SC1007
LEC/STUDIO | LT3
Teaching Wk1-9,11-13
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...