GATE | GATE-CS-2014-(Set-1) | Question 48

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

(A) A
(B) B
(C) C
(D) D

Answer: (D)
Explanation: Clique is an NP complete problem. If one NP complete problem can be solved in polynomial time, then all of them can be. So NPC set becomes equals to P.
Quiz of this Question

Article Tags :

GATE

GATE-CS-2014-(Set-1)

GATE-GATE-CS-2014-(Set-1)

Recommended Articles

1. GATE | GATE-CS-2014-(Set-1) | Question 1

2. GATE | GATE-CS-2014-(Set-1) | Question 2

3. GATE | GATE-CS-2014-(Set-1) | Question 3

4. GATE | GATE-CS-2014-(Set-1) | Question 4

5. GATE | GATE-CS-2014-(Set-1) | Question 5

6. GATE | GATE-CS-2014-(Set-1) | Question 6

7. GATE | GATE-CS-2014-(Set-1) | Question 7

8. GATE | GATE-CS-2014-(Set-1) | Question 65

9. GATE | GATE-CS-2014-(Set-1) | Question 65

10. GATE | GATE-CS-2014-(Set-1) | Question 65

11. GATE | GATE-CS-2014-(Set-1) | Question 11

12. GATE | GATE-CS-2014-(Set-1) | Question 65

13. GATE | GATE-CS-2014-(Set-1) | Question 13

14. GATE | GATE-CS-2014-(Set-1) | Question 65

15. GATE | GATE-CS-2014-(Set-1) | Question 15

16. GATE | GATE-CS-2014-(Set-1) | Question 16

17. GATE | GATE-CS-2014-(Set-1) | Question 65

18. GATE | GATE-CS-2014-(Set-1) | Question 18

19. GATE | GATE-CS-2014-(Set-1) | Question 19

20. GATE | GATE-CS-2014-(Set-1) | Question 20

21. GATE | GATE-CS-2014-(Set-1) | Question 21

22. GATE | GATE-CS-2014-(Set-1) | Question 22

23. GATE | GATE-CS-2014-(Set-1) | Question 23

24. GATE | GATE-CS-2014-(Set-1) | Question 25

25. GATE | GATE-CS-2014-(Set-1) | Question 65