# Theory Of Computation MCQ - Recursively enumerable sets and Turning machines

6:

Which of the following is not primitive recursive but partially recursive ?

 A. Carnot's function B. Ricmann function C. Bounded function D. Ackermann's function Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
7:

Turing machine (TM) is more powerful than FMS (Finite State Machine) because

 A. tape movement is confined to one direction B. it has no finite state C. it has the capability to remember arbitrarily long sequences of input symbols D. none of these Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
8:

If f : N--> N. If L can be recoognized by a TM T, so that τT(n) ≤ f (n) for all but finitely many n, then ( Time (f) means Time ( max ( f, 2n +2))).

 A. L  ∈Time (f) B. L  ∈  Time(cf) C. L  ∈ Time (h) D. none of these Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
9:

Let s is a step-counting function satisfying s(n) ≥ n, and L be a language accepted by a (multitape) TM T. If tape heads of T do not move past square s(n) on any of the tapes for an input string of length n, then T ∈

 A. Space(s) B. F(n) C. Time(f) D. Time(h) Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
10:

Which of the following statements is false ?

 A. Halting problem of Turing machines is undecidable B. Determining whether a context-free grammar is ambiguous is undecidable C. Given two arbitrary context-free grammars G1 G2 and it is undecidable whether L (G1) = L (G2). D. Given two regular grammars G1 G2 and it is undecidable whether L (G1) = L (G2) Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:

Syllabus covered in this section is-

• Regular languages and finite automata
• Context free languages and Push-down automata
• Recursively enumerable sets and Turing machines
• Undecidability, NPcompleteness
• Models of computation-Finite Automata
• Pushdown Automata
• Non-detenninism and NFA. DPDA and PDAs and Languages accepted by these Structures
• Grammars, Languages,
• Non- computability and Examples of non-computable problems

This Section covers Theory of Computation Questions Answers .These questions can be used for the preparation of various competitive and academic exams like

• UGC NET Computer Science
• Pre PhD Entrance Exam
• DOEACC Exams
• Kendriya Vidyalaya Sangathan Entrance Exam
• GATE Computer Science
• Post Graduate Computer Science Test
•  PhD Entrance Exam
• Computer Engineering
• National Eligibility Test (NET)
• State Eligibility Test (SET)

Who can benefit

• Theory of Computation Objective Questions Answers can be used by any student who is preparing for PhD entrance exam, pre PhD entrance exam, entrance exam or any other such exam.
• Any student who is preparing for DOEACC exams can also use Theory of Computation questions answers for preparation of his exams.
• Automata Theory mcq can be useful for the students who are pursuing any undergraduate or post graduate degree in computer science like BE, ME , Btech, Mtech, .BSc, MSc, BCA, MCA, BS, MS  or any other such degree
• Theory of Computation mcq with answers and explanation can also be useful for the students who are preparing for any competitive exam or recruitment exams like GATE Computer Science, UGC NET Computer Science, Kendriya Vidyalaya Sangathan PGT exam, PSU, IES or any other such exam.
• Theory of Computation multiple choice questions answers can also be used by any candidate who wants to gain credits in Theory of Computation in BS Computer science or MS Computer science.
• Theory of Computation mcq questions answers can be used for the preparation of National Eligibility Test (NET) and State Eligibility Test (SET).
• You can download Theory of Computation mcq pdf from this site.

Various Search Terms Used For This Section Are