Multiple Choice
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
C) P is in NP but not NP-complete
D) P is neither NP-hard nor in NP
Correct Answer:
Verified
Correct Answer:
Verified
Q10: Left hand side of a production in
Q11: Consider a graph G = (V, E)
Q12: Let FHAM be the problem of finding
Q13: If r1 = (aa + bb) and
Q14: Out of the three decision problems P1,
Q16: Which one of the following is not
Q17: Choose the incorrect statement.<br>A)A Mealy machine generates
Q18: The problem 3-SAT and 2-SAT are<br>A)Both in
Q19: Context free grammar is used for-<br>A)Lexical analyzer<br>B)Document
Q20: 3-SAT and 2-SAT problems are<br>A)NP-complete and in