Friday 22 November 2019

UGC NET PAPER 2 June 2019 Question 67 (Shift-I)

Question 67

Consider the complexity class CO-NP as the set of languages L such that L’ ε NP, and the following two statements:
S1 : P ⊆ CO-NP
S2 : If NP ≠ CO-NP, then P ≠ NP
Which of the following is/are correct?
  1. 1. Only S1
  2. 2. Only S2
  3. 3. Both S1 and S2
  4. 4. D Neither S1 nor S2

ANS. 3

PreviousNext
UGC NET CS 2018 July - II Question 66UGC NET CS 2018 July - II Question 68

No comments:

Post a Comment

UGC NET Computer Science December 2019 | Question 16

Question 16 In a certain coding language. 'AEIOU' is written as 'TNHDZ'. Using the same coding language. 'BFJPV' wil...

Popular Posts