647 views
0 votes
0 votes
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus

1 Answer

0 votes
0 votes
Yes, it is there in GATE 2019 syllabus. It is better to read all the Dynamic Programming problems as DP as a whole is in syllabus.

Related questions

0 votes
0 votes
1 answer
1
LavTheRawkstar asked Apr 15, 2017
3,954 views
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) .solve the given knapsack problem apply...
1 votes
1 votes
1 answer
2
0 votes
0 votes
0 answers
3
karan25gupta asked Apr 17, 2019
691 views
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQ...
0 votes
0 votes
1 answer
4
Parshu gate asked Nov 16, 2017
8,262 views
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. PQRSTUVWWeight1812161416201015Profit341522161722...