Worksheet -2.2
Name: Vivek Kumar
UID: 20BCS5690
Branch: BE-CSE
Semester: 5th
Section/Group: WM-613-B
Subject: DAA Lab
1. Aim/Overview of the practical:
To implement subset-sum problem using Dynamic Programming .
2. Task to be done/ Which logistics used:
find whether or not there exists any subset of the given set .
3. Algorithm/Flowchart:
i. We create a boolean subset[][] and fill it in bottom up manner.
ii. The value of subset[i][j] will be true if there is a subset of set[0..j-1] with sum equal to
i., otherwise false.
iii. subset[i][j] = true if there is a subset with:
iv. the i-th element as the last element * sum equal to j
v. subset[i][0] = true as sum of {} = 0
vi. subset[0][j] = false as with no elements we can get no sum
vii. subset[i][j] = subset[i-1][j-E1]; where E1 = array[i-1]
viii. Finally, we return subset[n][sum].
