M

Mr. Dubey • 52.26K Points
Coach 

Q. Which of the following is true about the time complexity of the recursive solution of set partition problem?

(A) it has an exponential time complexity
(B) it has a linear time complexity
(C) it has a logarithmic time complexity
(D) it has a time complexity of o(n2)
Correct : Option (A)

Explanation: 
 set partition problem has both recursive as well as dynamic programming solution. the recursive solution has an exponential time complexity as it will require to check for all subsets in the worst case.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs

Q. It consists of the message from superior to subordinate

Q. The circuit enables the generation of the ASCII code when the key is pressed.

Q. print(m(row), end = " ")

Q. Which of these is not a major type of cloud computing usage?

Q. Centralized control models

Q. Spinlocks are intended to provide only.

Q. Which is not a software life cycle model?

Q. An identification field in a record. Select the best fit for answer

Q. d1 > d2

Q. The network that involves backward links from output to the input and hidden layers is called