Subset sum problem is an example of NP- complete problem.

Related MCQs

• Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.
• What is a subset sum problem?
• Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
• Which of the following is not true about 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 will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
• 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?
• 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?
• Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?