CS701 Theory of Computation Solved Midterm Questions and MCQs

CS701 Theory of Computation Midterm Solved Questions and MCQs.

 

1. CS701 Theory of Computation - Post Correspondence Problem (PCP) is decidable over the unary alphabet -- Turing Machine

2. CS701 Theory of Computation - Show that ATM is not mapping reducible to ETM

3. CS701 Theory of Computation - 64 and 32965 are relative prime or not

4. CS701 Theory of Computation - G is a digraph and show that path is in class P

5. CS701 Theory of Computation - The collection of provable statement in Th(N, +, x) is Turing-recognizable

6. CS701 Theory of Computation - 7 parts of construction PCP (Post Correspondence Problem)

7. CS701 Theory of Computation - If A<= mB and B is Turing recognizable then A is Turing recognizable.

8. CS701 Theory of Computation-Let B be the set of all infinite sequence over {0,1}. Show that B is uncountable, using a proof by diagonalization

9. CS701 Theory of Computation-Show that the collection of Turing-recognizable language is closed under the operation.

10. CS701 Theory of Computation-how that T is countable.

11. CS701 Theory of Computation-midterm solved mcqs - Consider following instance of PCP

12. CS701 Theory of Computation-midterm solved mcqs

13. CS701 Theory of Computation-midterm solved mcqs

14. CS701 Theory of Computation-midterm solved mcqs

15. CS701 Theory of Computation-midterm solved mcqs