| CO | At the end of course , the student will be able to understand: | Bloom’s Level |
|---|---|---|
| CO1 | Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and grammars. | K4, K6 |
| CO2 | Analyse and design, Turing machines, formal languages, and grammars. | K4, K6 |
| CO3 | Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and complexity through problem solving. | K1, K5 |
| CO4 | Prove the basic results of the Theory of Computation. | K2, K3 |
| CO5 | State and explain the relevance of the Church-Turing thesis. | K1, K5 |

© Copyright 2021 Accurate Group. All Rights Reserved. Designed and Developed by BrandShow