TEJAA SHAKTHI INSTITUTE OF TECHNOLOGY FOR WOMEN KARUMATHAMPATI, COIMBATORE.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION
QUESTION BANK

UNIT I PART A: 1. What is a Turing machine? Give its schematic description. 2. Give the difference between finite automata & Turing machine. 3. Give the snapshot of TM computing even no of 0s. 4. Give the formal definition of a TM. 5. What is meant by a configuration of a TM? Give example. 6. What is meant by a yield? Give example. 7. What are the types of configuration? Define them. 8. Define Turing-recognizable language. 9. What are deciders? 10.Define Turing-decidable language. 11.Define recursively enumerable language. 12.Define variants of a TM. 13.Define robustness of a TM. 14.What is meant by the stay put feature of a TM? 15.List out the variants of a TM. 16.Give the formal definition of a Multi-tape TM. 17.Give the formal definition of a Nondeterministic TM. 18.What is meant by an enumerator? 19.Define Hilbert's problem. 20.What is a polynomial? Give its structure. 21.Define the Church-Turing thesis. 22.Define the term decidability. 23.What are decidable languages? Give example. 24.What is meant by an acceptance problem? Give example. 25. Is AREX a decidable language? If yes, prove. 26.Define symmetric difference. 27.Depict the relationship among classes of languages. 28.Define halting problem. Give an example. 29.Define Universal TM. 30.What is diagonalization method? 31.Define correspondence. Give example. 32.Define the term countable & uncountable. 33.What is meant by an infinite binary sequence? 34.What is characteristic sequence? 35.Define co-Turing-recognizable. 36.When a language is said to be decidable? 37.What is an acceptance problem? 38.Define symmetric difference. 39.Sketch the relationship among the classes of languages. 40.Define Halting problem. 41.What is diagonalization method? 42.Define the term correspondence. 43.What are uncountable sets? 44.Define the characteristic sequence of a language. 45.Define co-Turing recognizable language. PART B: 1. Explain the functions of a TM with an example. 2. Give an account on the variants of TM with neat diagrams.

3. Explain Church-Turing thesis based on the Hilberts problem. 4. Show that ADFA, ANFA, AREX, EDFA, EQDFA are decidable languages with suitable TM descriptions. (or) Show that the problems concerning finite automata are acceptance/decidable problems with suitable TM descriptions. 5. Show that the problems concerning CFGs are decidable with suitable TM descriptions. 6. What is Halting problem? Prove that it is undecidable using diagonalization method. UNIT II PART A: 1. Define reducibility. 2. What is meant by reduction? 3. Define the problem that describes whether a TM halts on a given input. (The question is HALTTM . You have to give its language & define it) 4. What is a computation history? Define its types. 5. Define linear bounded automaton (LBA). 6. List out the constraints of LBA. 7. Depict zig-zagging. 8. Define post correspondence problem. 9. What is a domino? 10.What is modified post correspondence problem? 11.Define mapping reducibility. 12.Define computable functions. 13.Define computability theory. 14.Define recursion theorem. 15. Define self-reference. (give the self diagram also) 16.What are the terminologies for recursion theorem? 17.Give the applications of recursion theorem. 18.Define minimal TM. 19.What is meant by the fixed-point of a function? 20.Define twin prime conjecture. 21.What are quantifiers? 22.What is a well-formed formula? 23.What is an atomic formula? 24.Define the scope of a quantifier. 25.Define prenex normal form. 26.What is meant by a free variable & sentence? 27.Define a model & its language. 28.Define the theory of a model. 29.What is meant by a decidable theory? 30.Define Turing reducibility. 31.Define an oracle TM. PART B: 1. Give the problems that are undecidable based on reducibility. Prove them individually. 2. Give the problems that are reducible via computation histories. Show that whether they are decidable or undecidable. 3. Define PCP. Show that PCP is undecidable with suitable example. 4. Explain mapping reducibility in detail with suitable examples (theorems). 5. Give an account on self-reference. (or) Explain in detail about recursion theorem. 6. Give a detailed account on decidability of logical theories with appropriate examples.

UNIT III PART A: 1. Define complexity theory. 2. Define time complexity or running time of a TM. (for both NTM & DTM you should write) 3. What is meant by worst-case analysis & average-case analysis? 4. Define asymptotic analysis. 5. What is meant by upper bound & lower bound? 6. What is meant by polynomial bound & exponential bound? 7. Define the time complexity class. 8. What is meant by a linear time? 9. Define brute-force search. 10.Define the class P. 11.List out all the problems that are in class P. 12.What is Euclidean algorithm? 13.Define dynamic programming. 14.Define the class NP. 15.What is Hamiltonian path? Give example. 16.Define polynomial verifiability. 17.What is a verifier? 18.What is meant by the term certificate? 19.List out all the problems that are in class NP. 20.Differentiate class P with class NP. 21.What is a clique? 22.Explain P vs NP. 23.Define NP-completeness. 24.List out all the problems that are NP complete. 25.Define satisfiability problem. 26.What are called as Boolean variables? 27.When a Boolean formula is said to be satisfiable? 28. Define Cook-Levins theorem. 29.Define polynomial time reducibility. 30.What is a cnf-formula? 31.Define 3cnf. 32.What is a literal? 33.Define tableau. 34.Define vertex-cover problem. 35.Define gadgets & its types. PART B: 1. Explain how to analyse the algorithms & measure its time complexity with suitable examples. 2. Explain the class P problems in detail. Prove that they belong to class P. 3. List out the problems in NP. Prove that they belong to NP class. 4. Explain how 3SAT is polynomial time reducible to CLIQUE. 5. Prove that SAT problem is NP-complete using Cook-Levins theorem. 6. Explain NP-completeness. Give the problems under NP-complete and show that they are NP-complete. 7. Prove that HAMPATH is NP-complete with suitable example.

UNIT IV PART A: 1. Define space complexity of a TM. 2. Define space complexity classes. 3. Define Savitchs theorem. 4. What is meant by yieldability problem? 5. Define PSPACE class. 6. Define PSPACE-completeness. 7. Depict the relationship among P, NP, PSPACE, and EXPTIME. 8. What is TQBF problem? 9. What are the types of quantifiers? 10.Define L & NL classes. 11.Define NL-completeness. 12.What is a log space transducer? 13.What is coNL? 14.Is NL=coNL? Justify your answer. 15.What is generalised geography problem? 16.What is formula-game? 17.Define intractability. 18.What is hierarchy theorem? 19.What are the types of hierarchy theorem? Define them. 20.Define the term space constructible. 21.Define the term time constructible. 22.Define exponential space completeness. 23.Define relativization. 24.What are the limits of diagonalization method? 25.Define circuit complexity. 26.What is a Boolean circuit? Give example & show how it is computed. 27.What is a circuit family? 28.Define size complexity of a circuit family. 29.Define depth complexity of a circuit family. 30.Define circuit size complexity of a language. 31.Define circuit depth complexity of a language. 32.P.T NL is a subset of PSPACE. 33.P.T PSPACE is a subset of EXPSPACE. 34. S.T if A L B & B L, then A L. PART 1. 2. 3. 4. 5. 6. 7. 8. B: Explain Savitchs theorem in detail with example. P.T TQBF is PSPACE-complete problem. P.T FORMULA-GAME & Generalised Geography problems are in PSPACE-complete. P.T NL=coNL with suitable algorithm. Explain types of hierarchy theorems with examples. Explain exponential space completeness with example. Explain circuit complexity with suitable problems. Give a detailed account on relativization.

UNIT V PART A: 1. What is meant by an optimization problem? 2. Define optimal solution. 3. Define approximation algorithm. 4. What is meant by decision problem? 5. What is meant by minimization & maximization problems? 6. Define the term k-optimal. 7. What is a probabilistic algorithm? 8. Define probabilistic TM. 9. Define coin-flip step. 10.Define the class BPP. 11.What is amplification lemma? 12.Define error probability. 13.What is meant by primality? 14.What is Fermat test? 15.Define Fermat's little theorem. 16.Define pseudoprime. 17.What is chinese remainder theorem? 18.Define RP class. 19.What is meant by branching program? 20.What is read-once branching program? 21.Define alternation. 22.Define alternating TM. 23.Define AP, APSPACE and AL classes. 24.What is tautology? 25.What is meant by interactive proof system? 26.Defien graph non-isomorphism problem. 27.What are the inputs of a verifier & a prover? Define them. 28.Define IP class. 29.Is IP=PSPACE? Justify your answer. 30.Define parallel computation. 31.What is PRAM? 32.Define uniform Boolean circuit. 33.What is the processor complexity of a Boolean circuit? 34.What is the parallel time complexity of a Boolean circuit? 35.When a family of circuit is said to be uniform? 36.Define NC class. 37.Define NC computable function. 38.Prove that NC is the subset of P. 39.What is cryptography? 40.What is a secret key? 41.Define the term one-time pad. 42.What is meant by private-key & public-key cryptosystem? 43.Define one-way permutation. 44.Define one-way function. 45.What is meant by trapdoor function? PART B: 1. Explain probabilistic algorithms in detail with an example problem(primality). 2. P.T EQROBP is in BPP class. 3. Give an account on alternation with suitable examples. 4. Explain interactive proof systems with an example problem. 5. Prove the following: a) IP = PSPACE b) IP PSPACE c) PSPACE IP 6. Define the counting problem for satisfiability. Prove that the language #SAT IP.

7. Prove the following : a) NC1 L b) NL NC2 c) NC P 8. Explain an application of complexity theory(cryptography) & its research fields.