Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) 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 : Option (B) - A is in NP but not P

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. is the maximum number of edges in an acyclic undirected graph with k vertices.

Q. Which of the following is required by K- means clustering?

Q. __________ are the basic building blocks of qualitative data.

Q. A 4-bit counter has a maximum modulus of

Q. the truth table for exclusive disjunction will be

Q. Sound power of a machine whose specified sound power level is 125 dB

Q. Suppose that we have N independent variables (X1,X2 Xn) and dependent variable is Y. Now Imagine that you are applying linear regression by fitting the best fit line using least square error on this data. You found that correlation coefficient for one of its variable(Say X1) with Y is -0.95.Which of the following is true for X1?

Q. The physical layer provides __________

Q. The Relation is----------if a has relation with b and b has relation with a.

Q. __________ is used for encrypting data at network level