The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged knapsack
0
votes
0
answers
1
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????
asked
4 days
ago
in
Algorithms
by
karan25gupta
(
123
points)

17
views
algorithms
dynamicprogramming
knapsack
0
votes
0
answers
2
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.
asked
Jan 8
in
Algorithms
by
Shivam Kasat
Active
(
3.1k
points)

37
views
algorithms
knapsack
0
votes
0
answers
3
Self doubt
How to solve fractional knapsack problem using heap ?
asked
Jul 22, 2018
in
Algorithms
by
Prince Sindhiya
Loyal
(
6.3k
points)

27
views
algorithms
knapsack
0
votes
1
answer
4
Fractional Knapsack
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
asked
Apr 30, 2018
in
Algorithms
by
Na462
Loyal
(
8.7k
points)

99
views
knapsack
0
votes
0
answers
5
General Topic Doubt: Algorithms  Dynamic Programming
Read the following statements about 0/1 Knapsack problem. (i) Time complexity of Knapsack is O(n* W) where W is the weight of the Knapsack and there are n items. (ii) Time complexity of Knapsack is min( O(n*W) , O(2^n) ) where W is the weight of the ... ) and (iii) is true (ii) and (iii) is true (i) ( iii) (iv) is true (ii) (iii) (iv) is true.
asked
Dec 13, 2017
in
Algorithms
by
VIKAS TIWARI
Junior
(
697
points)

475
views
algorithms
dynamicprogramming
knapsack
generaltopicdoubt
0
votes
1
answer
6
Knapsack
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. 90 80.25 85.50 91.2
asked
Nov 17, 2017
in
Algorithms
by
Parshu gate
Active
(
5.1k
points)

508
views
algorithms
knapsack
greedyalgorithm
fractional
+1
vote
0
answers
7
techtud
In the knapsack problem we are given a set of n items, where each item i is specified by a size si and a value vi. We are also given a size bound S (the size of our knapsack). The goal is to find the subset of items of maximum total value such that sum of their sizes is at ... needed. It is already complete algorithm. (B) arr[S][n]= result; (C) arr[n][n]= result; (D) arr[n][S] = result;
asked
Nov 8, 2017
in
Algorithms
by
Manoja Rajalakshmi A
Boss
(
11k
points)

82
views
knapsack
algorithms
0
votes
1
answer
8
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.
asked
Apr 15, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5.2k
points)

407
views
algorithms
knapsack
greedyalgorithm
+1
vote
1
answer
9
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
asked
Mar 26, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5.2k
points)

536
views
knapsack
algorithms
+1
vote
1
answer
10
Find the Optimal Solution of Fractional Knapsack where W=15
Item Total Weight Total Profit 1 2 10 2 3 5 3 5 15 4 7 7 5 1 6 6 4 18 7 1 3 Answer is 55.33 but how?
asked
Feb 28, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5.2k
points)

544
views
algorithms
knapsack
0
votes
1
answer
11
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}
asked
Feb 28, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5.2k
points)

388
views
fractional
knapsack
+6
votes
2
answers
12
KnapsackGreedy
asked
Jan 21, 2017
in
Algorithms
by
Sarvottam Patel
Active
(
1.1k
points)

528
views
greedyalgorithm
knapsack
algorithms
+5
votes
1
answer
13
0/1 knapsack
For 0/1 knapsack, we have to make the whole table or there is any direct method to this?
asked
Nov 6, 2016
in
Algorithms
by
vaishali jhalani
Loyal
(
6k
points)

613
views
algorithms
knapsack
0
votes
2
answers
14
UGCNETSep2013III42
Given 01 knapsack problem and fractional knapsack problem and the following statements: $S_1$: 01 knapsack is efficiently solved using Greedy algorithm. $S_2$: Fractional knapsack is efficiently solved using Dynamic programming. Which of the following is true? $S_1$ is ... $S_2$ are correct Both $S_1$ and $S_2$ are not correct $S_1$ is not correct and $S_2$ is correct
asked
Jul 24, 2016
in
Algorithms
by
jothee
Veteran
(
115k
points)

723
views
ugcnetsep2013iii
algorithms
knapsack
+1
vote
1
answer
15
UGCNETJune2014III62
Consider the fractional knapsack instance $n = 4, (p_{1} , p_{2} , p_{3} , p_{4} ) = (10, 10, 12, 18), (w_{1} , w_{2} , w_{3} , w_{4} ) = (2, 4, 6, 9)$ and $M = 15$. The maximum profit is given by (Assume $p$ and $w$ denotes profit and weight of objects respectively) $40$ $38$ $32$ $30$
asked
Jul 11, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
41.1k
points)

1.6k
views
ugcnetjune2014iii
algorithms
greedyalgorithm
knapsack
0
votes
0
answers
16
ugc dec13
asked
May 4, 2016
in
Algorithms
by
Sanjay Sharma
Veteran
(
50.7k
points)

59
views
knapsack
+4
votes
0
answers
17
Algorithm: Difference fractional Knapsack and 0/1 knapsack
The difference between maximum possible profit for 0/1 Knapsack and fractional Knapsack problem with capacity (W) = 20. Solution Given: I know how to do both the greedy and Dynamic programming. But i know only tabulation method, ... t know what shortcuts they used above. please suggest is there any easy way to other than tabulation method ?
asked
Jan 9, 2016
in
Algorithms
by
Prasanna
Active
(
4.9k
points)

6k
views
algorithms
knapsack
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT BHUBANESWAR MTECH WRITTEN TEST/INTERVIEW
GATE score validity queries.
How to prepare for IISC Interdisciplinary Mathematical Sciences Interview
GO Hardcopy for GATE 2020
How to prepare for BARC interview
Follow @csegate
Recent questions tagged knapsack
Recent Blog Comments
10000 to <2000 is really kind of achievement , my...
THey removed it this year... I did not check it,...
even though i am not going for iiit , can you...
I don't think IIITD requires any codechef...
Will apply for IIITB. IIIT D requires a codechef...
50,109
questions
53,221
answers
184,629
comments
70,463
users