New: filter modules by day and time, student links, custom courses →
AY2025/2026 Semester 1
This course aims to teach the concepts, implementations and applications of data structures such as arrays, linked lists, stacks, queues and trees that are important for building effi cient algorithms; It will develop your knowledge, understanding and skills about three algorithm design approaches to solve sorting problems (incremental, data structures and divide-and-conquer). It will also teach you how to select and implement appropriate searching algorithms (sequential search, binary search, search using hash tables), as part of a problem solution.
| AUs | 3.0 AUs |
| Categories | Core |
| Mutually Exclusive With | SC1007 |
| Exam |
| Mon | Tue | Wed | Thu | Fri | Sat | |
|---|---|---|---|---|---|---|
| 930 | 14540 TUT (COMP1) 0930-1150 Sat N4-1C-06 Wk1-7 | |||||
| 1000 | ||||||
| 1030 | ||||||
| 1100 | ||||||
| 1130 |