0 votes 0 votes Maximum profit using 0/1 Knapsack with W=200 is there any other than brute force method to solve this??? or we have to do only with tabular method?please solve and mention the way that is efficient w.r.t time if any. Algorithms algorithms dynamic-programming knapsack-problem numerical-answers made-easy-booklet + – Abhisek Tiwari 4 asked Dec 24, 2018 • retagged Jun 23, 2022 by Lakshman Bhaiya Abhisek Tiwari 4 613 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Satbir commented Dec 24, 2018 reply Follow Share in gate they give 4 or 5 elements so hit and trial works for it. 0 votes 0 votes srestha commented Dec 24, 2018 reply Follow Share Please put total question otherwise it cannot be solved 0 votes 0 votes pradeepchaudhary commented Dec 24, 2018 reply Follow Share Give the Capacity Of Knapsack? 0 votes 0 votes Abhisek Tiwari 4 commented Dec 24, 2018 reply Follow Share @pradeepchaudhary @srestha mam edited. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes First of all you have to find profit by weight ratio and then according to ratio you have put this in tabular form according to weight= 10+10+30+120+20 then profit according to weight is= 40+30+70+260+30 = 430 Answer is 430 Rahul271996 answered Dec 28, 2018 • edited Dec 28, 2018 by Rahul271996 Rahul271996 comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Rahul271996 commented Dec 28, 2018 reply Follow Share This is dynamic one and in fractional knapsack 200 complete weight is useful but in this Weight of capacity 10 left behind. 1 votes 1 votes Abhisek Tiwari 4 commented Dec 29, 2018 reply Follow Share @Rahul271996 how u did it? hit and trial? tabular method?plz see my Question note and ans accordingly. 0 votes 0 votes Rahul271996 commented Dec 29, 2018 reply Follow Share This process is similar to that fractional knapsack but in this, you have to take either full or not means that you can not take fraction part you have to left it. 0 votes 0 votes Please log in or register to add a comment.