GATE 2009
October 15, 2023
Digital-Logic-Design
October 15, 2023
GATE 2009
October 15, 2023
Digital-Logic-Design
October 15, 2023

GATE 2009

Question 14

Let πA be a problem that belongs to the class NP. Then which one of the following is TRUE?

A
There is no polynomial time algorithm for πA.
B
If πA can be solved deterministically in polynomial time,then P = NP.
C
If πA is NP-hard, then it is NP-complete.
D
πA may be undecidable.
Question 14 Explanation: 
Note: Out of syllabus.
Correct Answer: C
Question 14 Explanation: 
Note: Out of syllabus.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!