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.
| AUs | 3.0 AUs |
| Grade Type | |
| Prerequisite | SC1007, SC2001(Corequisite), SC2301(Corequisite) |
| Not Available To Programme | |
| Not Available To All Programme With | (Admyr 2011-2023) |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1030 | COMMON LEC (SCL2) 1030-1120 Thu LT3 | ||||
| 1100 | |||||
| 1130 | 10318 TUT (SDDB) 1130-1220 Thu LT15 | ||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | COMMON LEC (SCL2) 1430-1520 Tue LT3 | ||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | 10317 TUT (SDDA) 1630-1720 Tue TR+8 | ||||
| 1700 |
Other offerings
Other Relevant Mods
SC1003
Introduction To Computational Thinking & Programming
SC1004
Linear Algebra For Computing
SC1005
Digital Logic
SC1006
Computer Organisation & Architecture
SC1007
Data Structures & Algorithms
SC1008
C & C++ Programming
SC1104
Linear Algebra For Computing
SC1124
Math 2: Discrete Structures For Computing
SC1302
Ethics