Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Testbook Test Series
rsansiya111
asked
in
Algorithms
Dec 17, 2021
retagged
Jun 17, 2022
by
makhdoom ghaya
332
views
0
votes
0
votes
testbook-test-series
greedy-algorithm
knapsack-problem
rsansiya111
asked
in
Algorithms
Dec 17, 2021
retagged
Jun 17, 2022
by
makhdoom ghaya
by
rsansiya111
332
views
answer
comment
Follow
share this
share
1 comment
by
LRU
commented
Dec 17, 2021
reply
Follow
share this
Only statement 2 is correct. Rest all wrong.
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
Answer : Only $\text{(i)}$ is correct.
For Fractional Knap Sack we can have Greedy algorithm but that
does not give optimal solution
for 0/1 Knap Sack .
Prim’s Algorithm to find MST of graph uses
Greedy Approach .
Traveling Salesman problem can be solved using Dynamic Programming in
$O(2^n.n^2)$
Zack Fair
answered
Dec 23, 2021
by
Zack Fair
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
LRU
asked
in
Algorithms
Dec 28, 2021
1,582
views
Applied Test Series
Consider the following items with their associated weights and values. If a knapsack of capacity 25 units of weight is available and we are allowed to take either the item completely or leave it the maximum possible profit if we follow the greedy approach by being greedy about profit is _____
LRU
asked
in
Algorithms
Dec 28, 2021
by
LRU
1.6k
views
test-series
knapsack-problem
algorithms
greedy-algorithm
1
vote
1
vote
2
answers
2
admin
asked
in
Algorithms
Mar 30, 2020
2,627
views
NIELIT 2017 July Scientist B (IT) - Section B: 60
$0/1$-Knapsack is a well known problem where, it is desired to get the maximum total profit by placing $n$ items (each item is having some weight and associated profit) into a knapsack of capacity $W$. The table given below shows the weights and associated ... $19$ $18$ $17$ $20$
admin
asked
in
Algorithms
Mar 30, 2020
by
admin
2.6k
views
nielit2017july-scientistb-it
algorithms
greedy-algorithm
knapsack-problem
0
votes
0
votes
1
answer
3
Parshu gate
asked
in
Algorithms
Nov 16, 2017
8,248
views
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
Parshu gate
asked
in
Algorithms
Nov 16, 2017
by
Parshu gate
8.2k
views
algorithms
greedy-algorithm
knapsack-problem
0
votes
0
votes
1
answer
4
LavTheRawkstar
asked
in
Algorithms
Apr 15, 2017
3,873
views
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.
LavTheRawkstar
asked
in
Algorithms
Apr 15, 2017
by
LavTheRawkstar
3.9k
views
algorithms
knapsack-problem
greedy-algorithm
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy