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. Which of the following component is required for both online and local data access in hybrid application?

Q. In TDM, the transmission rate of a multiplexed path is always the sum of the transmission rates of the signal sources.

Q. is a loss in the purchasing power of money over time.

Q. An alternative to JavaScript on windows platform is

Q. Functional testing is known as:

Q. Which of the following was one of the top 5 cloud applications in 2010?

Q. A specialist in charge of the database of an organization select the best fit for answer

Q. A variable which is declared inside a method is called a________variable

Q. How many flip-flops are in the 7475 IC?

Q. What is the size of Host bits in Class B of IP address?

Question analytics