M

Mr. Dubey • 100.69K Points
Coach

Q. A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Share
Explanation by: Mr. Dubey
one of the properties of np class problems states that a non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Modern Computers are very reliable but they are not

Q. Which of the following term is best defined by the statement: “Derive traceability information to maximize information hiding in the design.&rdq

Q. The correlation coefficient for two real-valued attributes is –0.85. What does this value tell you?

Q. The mutation operator .

Q. The active data warehouse architecture includes __________

Q. who consider diagrams as a type of Class diagram, component diagram, object diagram, and deployment diagram?

Q. Operators with the same precedence are evaluated in which manner?

Q. …………. is an activity oriented diagram.

Q. ---------- The damage that occurs when the program encounters an error.

Q. What is a medium-term scheduler?

Question analytics