Open In App
Related Articles

ISRO | ISRO CS 2018 | Question 4

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
The following paradigm can be used to find the solution of the problem in minimum time: Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K: (A) Divide and Conquer (B) Dynamic Programming (C) Greedy Algorithm (D) Branch and Bound

Answer: (B)

Explanation: Given problem is Subset-sum problem in which a set of non-negative integers, and a value sum is given, to determine if there is a subset of the given set with sum equal to given sum. With recursion technique, time complexity of the above problem is exponential. We can solve the problem in Pseudo-polynomial time using Dynamic programming. Refer: Subset Sum Problem Option (B) is correct

Quiz of this Question

Last Updated : 05 Jul, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads