Q. Which of the following statement is false for a turing machine?
✅ Correct Answer: (D)
Turing recognizable languages are closed under union and complementation
Theory of Computation MCQs | Page - 15
Dear candidates you will find MCQ questions of Theory of Computation here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Q. Two persons X and Y have been asked to show that a certain problem p is NP-complete. X shows a polynomial time reduction from the 3-SAT problem to p and Y shows a polynomial time reduction from p to 3-SAT. From these reduction it can be inferred that
✅ Correct Answer: (A)
P is NP-complete
Q. 3-SAT and 2-SAT problems are
✅ Correct Answer: (A)
NP-complete and in P respectively
Q. Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be
✅ Correct Answer: (D)
n + 1
Q. Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as
✅ Correct Answer: (A)
Regular
Q. State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be
✅ Correct Answer: (D)
3
Q. Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is
✅ Correct Answer: (D)
P3 is undecidable if P2 is reducible to P3
Jump to