M

Mr. Dubey • 52.30K Points
Coach 

Q. Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (B)

Explanation: 
 the recursive solution to set partition problem takes exponential time complexity whereas the dynamic programming solution takes polynomial time complexity. so dynamic programming solution is faster in terms of time complexity.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Changing cardinalities in a database is:

Q. Which of the following is / are the output of the Software Process?

Q. It consists of the message from superior to subordinate

Q. The department relation has the an entry budget whose type has to be replaced by

Q. People frequently counter the idea of feedback

Q. Who developed Intergrated Circuits?

Q. Which of these comes under business activities?

Q. 3: Flip-flop outputs are always

Q. Highly summarized data is __________.

Q. f() x