Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.
A) A is in NP.
B) A is in NP but not P
C) A is in both NP and P.
D) A is NP-complete.
Correct Answer:
Verified
Q3: Consider the regular language L =(111+11111)*. The
Q4: Give a production grammar for the language
Q5: The production Grammar is {S->aSbb,S->abb} is
A)type-3 grammar
B)type-2
Q6: Regular expression (x/y)(x/y) denotes the set
A){xy,xy}
B){xx,xy,yx,yy}
C){x,y}
D){x,y,xy}
Q7: The regular expression have all strings in
Q9: Which of the following assertions about Turing
Q10: A PC not connected to a network
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
Q12: Let L1 be a recursive language, and
Q13: Let S be an NP-complete problem, Q
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents