Q. Context free grammar is used for-
β
Correct Answer: (B)
Document type definition (DTD)
Theory of Computation MCQs | Page - 14
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. The set strings of 0's and 1's with atmost one pair consecutive one's-
β
Correct Answer: (D)
(0+!)(01)*(10)*(0+1)
Q. The problem 3-SAT and 2-SAT are
β
Correct Answer: (C)
NP-complete and in P respectively
Q. Which of the following instances of the post correspondence problem has a viable sequence (a solution)?
β
Correct Answer: (C)
{(ab, abb), (ba, aaa), (aa, a)}
Q. Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE?
β
Correct Answer: (A)
Both FHAM and DHAM are NP-hard
Q. Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.
β
Correct Answer: (C)
P3 is NP complete if P2 is reducible to P3
Q. Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet Σ?
β
Correct Answer: (D)
L is a regular set
Q. Which one of the following is not decidable?
β
Correct Answer: (B)
equivalence of two given Turing machines
Q. Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
β
Correct Answer: (A)
1, 2 and 3
Q. Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is
β
Correct Answer: (C)
Both SHAM3 and DHAM3 are NP-hard
Jump to