UCL · COMP0003 · Computer Science
COMP0003 Theory of Computation: exam practice questions, marked
Practise for COMP0003 Theory of Computation at UCL with 45 quick-recall questions, 18 exam-style questions and 9 first-class stretch questions, written from the module’s published description. Write an answer and get it marked against UCL’s grade bands in about 30 seconds, with the exact sentences that lost marks and three changes to reach the next class.
Try one free, no sign-up Create a free account
Example COMP0003 question
(a) Use a truth table to decide whether (p→q)∧(q→r)→(p→r) is a tautology. [4] (b) Convert (p↔q)→r to conjunctive normal form, showing each step. [6] (c) Is the CNF formula (p∨q)∧(¬p∨q)∧(p∨¬q)∧(¬p∨¬q) satisfiable? Justify. [3]
Topics covered
- Propositional Logic: Syntax and Semantics
- Propositional Proof Systems
- First-Order Logic: Syntax and Semantics
- First-Order Proofs, Entailment and Undecidability
- Proof by Induction
- Modal Logic: Kripke Semantics
- Finite Automata and Regular Languages
- Context-Free Grammars and Pushdown Automata
- Turing Machines and Decidability
About the module
Aims:The module aims to introduce students to formal logical reasoning and to fundamental concepts in the theory of computation and formal languages.Intended...
Unizy is an independent revision tool and is not affiliated with or endorsed by UCL. Marks are practice estimates, not official marks.