Register

Recent questions tagged knapsack-problem

0 votes
1 answer
2
#aktu #aktu 2016-17
please provide the solution
please provide the solution
User Avatar
0 votes
1 answer
4
Applied Test Series: Knapsack Problem
The following table givens the frequency of 4 letters in a database of text If Huffman encoding is used to encode the word “aaabca” the number of bits required for it is given by ______. Need help!
The following table givens the frequency of 4 letters in a database of textIf Huffman encoding is used to encode the word “aaabca” the number of bits required for it ...
User Avatar
0 votes
0 answers
9
self doubt *0/1 knapsack problem*
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 EQUAL TO W OR IT CAN BE LESS THAN W AS WELL????
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...
User Avatar
0 votes
1 answer
10
self doubt
Can we solve fractional knapsack using dynamic programming?
Can we solve fractional knapsack using dynamic programming?
User Avatar
0 votes
0 answers
11
self_doubt
Is there any better approach to solve 0/1 knapsack problem other than tabular method ? as it consumes a lot of time when greater number of objects are given.
Is there any better approach to solve 0/1 knapsack problem other than tabular method ? as it consumes a lot of time when greater number of objects are given.
User Avatar
0 votes
1 answer
12
MadeEasyAlgo
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.
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 mentio...
User Avatar
0 votes
1 answer
13
Dynamic Programming
What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time? Not How to
What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time?Not How to
User Avatar
0 votes
0 answers
15
Self doubt
How to solve fractional knapsack problem using heap ?
How to solve fractional knapsack problem using heap ?
User Avatar
0 votes
1 answer
16
Time complexity analysis
What will be the time complexity if fractional knapsack is implemented using min heap instead of sorted array a) O(nlogn) b)O(n^2) c)O(n) d) none of these
What will be the time complexity if fractional knapsack is implemented using min heap instead of sorted arraya) O(nlogn)b)O(n^2)c)O(n)d) none of these
User Avatar
0 votes
1 answer
17
Fractional Knapsack
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
User Avatar
0 votes
1 answer
19
Knapsack
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. P Q R S T U V W Weight 18 12 16 14 16 20 10 15 Profit 34 15 22 16 17 22 18 26 90 80.25 85.50 91.2
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. PQRSTUVWWeight1812161416201015Profit341522161722...
User Avatar
0 votes
1 answer
22
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
User Avatar
1 votes
1 answer
23
algorithm
how is 0/1 knapsack time complexity O(2^n/2) ?
how is 0/1 knapsack time complexity O(2^n/2) ?
User Avatar
0 votes
1 answer
24
Fractional Knapsack(Greedy Method)
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 applying greedy algorithm.
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...
User Avatar
1 votes
1 answer
25
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having confusion How to solve using dy...
User Avatar
1 votes
1 answer
27
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}Given the capacity is 5,{W/M = 5 } Find the optimal solu...
User Avatar
Page: