M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following is not true about subset sum problem?

  • (A) the recursive solution has a time complexity of o(2n)
  • (B) there is no known solution that takes polynomial time
  • (C) the recursive solution is slower than dynamic programming solution
  • (D) the dynamic programming solution has a time complexity of o(n log n)
Share
Explanation by: Mr. Dubey
recursive solution of subset sum problem is slower than dynamic problem solution in terms of time complexity.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Divide ( 101110) 2 by ( 101)2.

Q. An un-interruptible unit is known as

Q. Cardinality of an attribute is

Q. LoadRunner create load by running ……

Q. The OR gate performs Boolean .

Q. A unique piece of information that is used in encryption.

Q. A compression technique consists of two basic components such as

Q. An operation can be described as?

Q. When the base of the logarithm is e, the unit of measure of information is

Q. mouse was invented by

Question analytics