This course introduces the foundational theory of computation through the study of formal models such as finite automata, pushdown automata, and Turing machines, along with key ideas in computability and complexity. You will learn to reason rigorously about computational models, distinguish between decidable and undecidable problems, and classify problems based on their computational difficulty. These skills provide the theoretical basis for further studies in algorithms, programming languages, cryptography, and AI.
| Academic Units | 3 |
| Exam Schedule | Wed Dec 03 2025 00:00:00 GMT+0000 (Coordinated Universal Time) 09:00-11:00 |
| Grade Type | Letter Graded |
| Department Maintaining | CSC(CE) |
| Prerequisites | SC1007 & SC2001(Corequisite) OR SC1007 & SC2301(Corequisite) |
| Not Available to All Programme | (Admyr 2011-2023) |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|---|---|---|---|---|---|
| - | LEC/STUDIO | SCL2 | TUE | 0830-1020 | ONLINE | Teaching Wk10 |
| LEC/STUDIO | SCL2 | TUE | 0830-1020 | LT2A | Teaching Wk1-9,11-13 |
0930
1030
1130
1230
1330
1430
1530
1630
1730
SC2203
LEC/STUDIO | ONLINE
Teaching Wk10
SC2203
10261
TUT | ONLINE
Teaching Wk10
SC2203
LEC/STUDIO | LT2A
Teaching Wk1-9,11-13
SC2203
10261
TUT | LT9
Teaching Wk2-9,11-13
SC2203
10259
TUT | ONLINE
Teaching Wk10
SC2203
10259
TUT | LT13
Teaching Wk2-9,11-13
SC2203
10260
TUT | ONLINE
Teaching Wk10
SC2203
10260
TUT | LT10
Teaching Wk2-9,11-13
SC2203
10257
TUT | ONLINE
Teaching Wk10
SC2203
10257
TUT | LT9
Teaching Wk2-9,11-13
SC2203
10258
TUT | ONLINE
Teaching Wk10
SC2203
10258
TUT | LT10
Teaching Wk2-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): ...