Professional Documents
Culture Documents
1. Define recursive and recursively enumerable language. 1. Define recursive and recursively enumerable language.
2. Define primitive recursive function with example. 2. Define primitive recursive function with example.
3. Compare class P and class NP problem. 3. Compare class P and class NP problem.
4. Define universal turing machine. 4. Define universal turing machine.
5. Define PCP and MPCP with example. 5. Define PCP and MPCP with example.
6. List the classification of problems. 6. List the classification of problems.
7. Compare NSA and SA language. 7. Compare NSA and SA language.
8. Is ‘Tower of Hanoi’ problem is tractable or intractable. Justify 8. Is ‘Tower of Hanoi’ problem is tractable or intractable. Justify
your answer. your answer.
9. a) Explain in detail about recursive and recursive enumerable 9. a) Explain in detail about recursive and recursive enumerable
language along with its properties. language along with its properties.
(or) (or)
b) Explain in detail about Primitive Recursive Function. b) Explain in detail about Primitive Recursive Function.
10. a) Explain the following 10. a) Explain the following
(i) Class P Problems. (i) Class P Problems.
(ii) Class NP Problems. (ii) Class NP Problems.
(iii) NP Complete and NP Hard Problems. (iii) NP Complete and NP Hard Problems.
(or) (or)
b) Explain Post Correspondence Problem and MPCP with example. b) Explain Post Correspondence Problem and MPCP with example.
11. State and prove Rice’s theorem. 11. State and prove Rice’s theorem.
*************** ***************