[Solved] Which of the following is not true about subset sum problem?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Which of the following is not true about...

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)
Answer» D. the dynamic programming solution has a time complexity of o(n log n)
Explanation: recursive solution of subset sum problem is slower than dynamic problem solution in terms of time complexity.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

Subset sum problem is an example of NP- complete problem.
Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
What is a subset sum problem?
What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?