Worksheet-2.3
Name: Vivek Kumar
UID: 20BCS5690
Branch: BE-CSE
Semester: 5th
Section/Group: WM-613-B
Subject: DAA Lab
1. Aim/Overview of the practical:
Code to implement 0-1 Knapsack using Dynamic Programming.
2. Task to be done/ Which logistics used:
Dynamic-0-1-knapsack Problem.
3. Algorithm/Steps:
1. Calculate the profit-weight ratio for each item or product.
2. Arrange the items on the basis of ratio in descending order.
3. Take the product having the highest ratio and put it in the sack.
4. Reduce the sack capacity by the weight of that product.
5. Add the profit value of that product to the total profit.
6. Repeat the above three steps till the capacity of sack becomes 0 i.e. until the sack is full.
for w = 0 to W do
c[0, w] = 0
for i = 1 to n do
c[i, 0] = 0
for w = 1 to W do
if wi ≤ w thenif vi + c[i-1, w-wi] then
