edited by
5,042 views
3 votes
3 votes

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$:

  1. Divide and Conquer
  2. Dynamic Programming
  3. Greedy Algorithm
  4. Branch and Bound
edited by

1 Answer

Best answer
3 votes
3 votes
it's subset sum problem which required dynamic programming to solve.so option B is correct.
selected by
Answer:

Related questions

25 votes
25 votes
2 answers
1
Kathleen asked Sep 25, 2014
9,064 views
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...
1 votes
1 votes
2 answers
2
1 votes
1 votes
1 answer
3
Arjun asked Apr 22, 2018
5,116 views
An array $A$ consists of $n$ integers in locations $A[0], A , \ldots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $k$ places, wher...
4 votes
4 votes
2 answers
4
Arjun asked Apr 22, 2018
3,848 views
Which of the following is application of Breath First Search on the graph?Finding diameter of the graphFinding bipartite graphBoth (a) and (b)None of the above