M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following is true about the time complexity of the recursive solution of the subset sum 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)
Share
Explanation by: Mr. Dubey
subset sum 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 worst case.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What does the data signal do in the keypad application?

Q. A bootstrap is :

Q. A Non-Functional Software testing done to check if the user interface is easy to use and understand

Q. Represents the number of discrete levers in the inheritance tree where subclasses inherit attributes and operations from super classes.

Q. Frame relay has only _______

Q. What is the first octet range for a class A IP address?

Q. The following grammar G = (N, T, P, S) N = {S, A, B} T = {a, b, c} P : S → aSa S → aAa A → bB B → bB B → c is

Q. During software development, which factor is most crucial?

Q. MBO offers the basis for assessing the ---

Q. print(list(d.keys()))

Question analytics