Scribd
Upload
173 views

Theory of Computation (Chapter - Unit 4) Solved MCQs (Set-1)

This document contains 25 multiple choice questions about theory of computation concepts. The questions cover topics like complexity classes P and NP, decidability, reducibility, finite automata, pushdown automata, Turing machines, and more. Sample questions ask about whether problems like finding a Hamiltonian cycle are NP-hard or NP-complete, properties of languages and machines, and statements that can be deduced about problems based on their verifiability.

Uploaded by

Yati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
173 views

Theory of Computation (Chapter - Unit 4) Solved MCQs (Set-1)

This document contains 25 multiple choice questions about theory of computation concepts. The questions cover topics like complexity classes P and NP, decidability, reducibility, finite automata, pushdown automata, Turing machines, and more. Sample questions ask about whether problems like finding a Hamiltonian cycle are NP-hard or NP-complete, properties of languages and machines, and statements that can be deduced about problems based on their verifiability.

Uploaded by

Yati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Theory of Computation MCQs [set-1]

Chapter: Unit 4

1. 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?
A. Both FHAM and DHAM are NP-hard
B. FHAM is NP hard, but DHAM is not
C. DHAM is NP hard, but FHAM is not
D. Neither FHAM nor DHAM is NP hard
Answer: A
m
o that P1 has polynomial time
c
2. Consider three problems P1, P2 and P3. It is known
.
e
solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.

at
A. P3 has polynomial time solution if P1 is polynomial time reducible to P3

M
B. P3 is NP complete if P3 is polynomial time reducible to P2
q
c
C. P3 is NP complete if P2 is reducible to P3

M
D. P3 has polynomial time complexity and P3 is reducible to P2
Answer: C

3. Which one of the following is the strongest correct statement about a finite
language Lover a finite alphabet ??
A. L is undecidable
B. L is recursive
C. L is a CSL
D. L is a regular set
Answer: D

4. Which one of the following is not decidable?


A. given a Turing machine M, a string s, and an integer k, M accepts s with k steps
B. equivalence of two given Turing machines
C. language accepted by a given DFSA is nonempty
D. language generated by a CFG is nonempty
Answer: B
5. 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.
A. 1, 2 and 3
B. 1 and 2 only
C. 2 and 3 only
D. 1 and 3 only
Answer: A

6. 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
A. Only DHAM3 is NP-hard
B. Only SHAM3 is NP-hard
C. Both SHAM3 and DHAM3 are NP-hard
D. Neither SHAM3 nor DHAM3 is NP-hard
Answer: C

7. Which of the following statement is false for a turing machine?


A. There exists an equivalent deterministic turing machine for every nondeterministic turing
machine
B. Turing decidable languages are closed under intersection and complementation
C. Turing recognizable languages are closed under union and intersection
D. Turing recognizable languages are closed under union and complementation
Answer: D

8. 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
A. P is NP-complete
B. P is NP-hard but not NP-complete

Download more sets at McqMate.com


C. P is in NP but not NP-complete
D. P is neither NP-hard nor in NP
Answer: A

9. 3-SAT and 2-SAT problems are


A. NP-complete and in P respectively
B. Undecidable and NP-complete
C. Both NP-complete
D. Both in P
Answer: A

10. 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
A. 2k + 1
B. k + 1
C. 2n + 1
D. n + 1
Answer: D

11. Consider a stack, which is limited to 10 items. The language accepted by a


push- down automaton in such stack is best described as
A. Regular
B. Deterministic context free
C. Context free
D. Recursive
Answer: A

12. 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
A. 2
B. 7
C. 4
D. 3
Answer: D

Download more sets at McqMate.com


13. Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is
undecidable. The statement that holds true is
A. P3 is decidable if P3 is reducible to compliment of P2
B. P3 is decidable if P1 is reducible to P3
C. P3 is undecidable if P1 is reducible to P3
D. P3 is undecidable if P2 is reducible to P3
Answer: D

14. The set which is not countable if we have ? = {a, b}, is


A. Set of all languages over ? accepted by turing machine
B. Set of all regular languages over ?
C. Set of all strings over ?
D. Set of all languages over ?
Answer: D

15. How many states are present in the minimum state finite automaton that
recognizes the language represented by the regular expression (0+1)(0+1)…..N
times?
A. n+1
B. n+2
C. n
D. 2n
Answer: B

16. Consider the state table of a finite state machine that has input x and a single
output z. The shortest input sequence to reach the final state C if the initial state is
unknown is
A. 10
B. 01
C. 101
D. 110
Answer: A

17. The set that can be recognized by a deterministic finite state automaton is
A. The set {1, 101, 11011, 1110111, …….}
B. The set of binary string in which the number of 0’s is same as the number of1’s
C. 1, 2, 4, 8……2n ….. written in binary

Download more sets at McqMate.com


D. 1, 2, 4, 8……2n ….. written in unary
Answer: C

18. Suppose that a problem A is known to have a polynomial-time verification


algorithm. Which of the following statements can be deduced.
A. A is in NP.
B. A is in NP but not P
C. A is in both NP and P.
D. A is NP-complete.
Answer: B

19. Which of the following assertions about Turing Machines is true? Blank
symbol(s) may occur in the input. At any stage of a computation, there are only
finitely many non-blank Symbols on the tape.
A. Assertions (a) and (b) are both true.
B. Neither (a) nor (b) is true.
C. Both False
D. None of above
Answer: C

20. A PC not connected to a network is equivalent to


A. A Deterministic Finite-State Automaton,
B. A Turing Machine,
C. A Push-Down Automaton,
D. None of the above.
Answer: A

21. Recursively enumerable languages are not closed under:


A. Union
B. Intersection
C. Complementation
D. Concatenation
Answer: C

22. Let L1 be a recursive language, and let L2 be a recursively enumerable but not
a recursive language. Which one of the following is TRUE?
A. (L1)’ is recursive and (L2)’ is recursively enumerable
B. (L1)’ is recursive and (L2)’ is not recursively enumerable

Download more sets at McqMate.com


C. (L1)’ and (L2)’ are recursively enumerable
D. (L1)’ is recursively enumerable and (L2)’ is recursive
Answer: B

23. Let S be an NP-complete problem, Q and R be two other problems not known
to be in NP. Q is polynomial-time reducible to S and S is polynomial-time reducible
to R. Which one of the following statements is true?
A. R is NP-complete
B. R is NP-hard
C. Q is NP-complete
D. Q is NP-hard
Answer: A

24. For s ? (0+1)* let d(s) denote the decimal value of s(e.g.d(101)) = 5 Let L = {s ?
(0+1)* d(s) mod 5=2 and d(s) mod 7 != 4} Which one of the following statements is
true?
A. L is recursively enumerable, but not recursive
B. L is recursive, but not context-free
C. L is context-free, but not regular
D. L is regular
Answer: D

25. A FSM can be considered, having finite tape length without rewinding
capability and unidirectional tape movement
A. Turing machine
B. Pushdown automata
C. Context free languages
D. Regular languages
Answer: A

Download more sets at McqMate.com

You might also like