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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
How to solve fractional knapsack problem using heap ?
asked
Jul 22
in
Algorithms
by
Prince Sindhiya
Active
(
4.3k
points)

19
views
algorithms
knapsack
0
votes
1
answer
2
Fractional Knapsack
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
asked
Apr 30
in
Algorithms
by
Na462
Loyal
(
6.7k
points)

64
views
knapsack
0
votes
0
answers
3
0/1 Knapsack problem
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 Knapsack and there are n ... option (i) 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
(
559
points)

321
views
0
1
knapsack
problem
algorithms
fractional
0
votes
1
answer
4
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
(
5k
points)

377
views
algorithms
knapsack
greedyalgorithm
fractional
+1
vote
0
answers
5
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
Active
(
4.1k
points)

62
views
knapsack
algorithms
0
votes
1
answer
6
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)

244
views
algorithms
knapsack
greedyalgorithm
+1
vote
1
answer
7
#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)

403
views
knapsack
algorithms
+1
vote
1
answer
8
Find the Optimal Solution of Fractional Knapsack where W=15
asked
Feb 28, 2017
in
Algorithms
by
LavTheRawkstar
Active
(
5.2k
points)

352
views
algorithms
knapsack
0
votes
1
answer
9
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)

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

434
views
greedyalgorithm
knapsack
algorithms
+5
votes
1
answer
11
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
(
5.9k
points)

443
views
algorithms
knapsack
0
votes
2
answers
12
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? ... Both $S_1$ and $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
(
105k
points)

604
views
ugcnetsep2013iii
algorithms
knapsack
+1
vote
1
answer
13
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
(
40.4k
points)

1.3k
views
ugcnetjune2014iii
algorithms
greedyalgorithm
knapsack
0
votes
0
answers
14
ugc dec13
asked
May 4, 2016
in
Algorithms
by
Sanjay Sharma
Boss
(
49.6k
points)

53
views
knapsack
+3
votes
0
answers
15
Algorithm: Difference fractional Knapsack and 0/1 knapsack
asked
Jan 9, 2016
in
Algorithms
by
Prasanna
Active
(
4.8k
points)

5.2k
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 Madras Phd
Databases GO Classroom
I need help in Preparation for 2020
Happy Birthday Sir Arjun
NIELIT EXAM DATE 2018
Follow @csegate
Gatecse
Recent questions tagged knapsack
Recent Blog Comments
They are not reviewed by GO. But they will be...
What is the job profile for candidate at AAI and...
GATEBOOK2019 DS1 doesn't have solutions,...
How to prepare for aptitude part?
Belated happy birthday to you, sir :)
42,296
questions
48,419
answers
153,540
comments
62,661
users