M

Mr. Dubey • 52.30K Points
Coach 

Q.                    is the class of decision problems that can be solved by non- deterministic polynomial algorithms?

(A) np
(B) p
(C) hard
(D) complete
Correct : Option (A)

Explanation: 
 np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. In 1-to-4 multiplexer, if C1 = 1 & C2 = 1, then the output will be

Q. What allows TCP to detect lost segments and in turn recover from that loss?

Q. if there are no nodes in linked list then start pointer will point at which value?

Q. Which of the following is a data link protocol?

Q. The number of tokens in the following C statement is (GATE 2000) printf("i = %d, &i = %x", i, &i);

Q. RMI uses stub and skeleton for communication with the object.

Q. Convert BCD 0001 0111 to binary.

Q. Which command enables alteration the data stored in existing records:

Q. The composition of function is associative but not _______.

Q. In Schedule contract the contractor undertakes the execution or construction of specific work with all its contingencies, to complete it in all respec