GATE | CS | 2014 | Set 1 | Algorithms | Complexity Analysis | Question 11

Last Updated :
Discuss
Comments

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)?

GATECS2014Q48

A

B

C

D

This question is part of this quiz :

Top MCQs on NP Complete Complexity with Answers,GATE-CS-2014-(Set-1)
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy