3.4 Knapsack Problem | Greedy Method | Design and Analysis of Algorithms

➡ Do not miss our Bestseller Courses:

➡ Contact Us:
📞Call on: [phone]

➡ Our One Shot Semester Exam Videos: 👇

➡ Free Subject-Wise Complete PlayList: 👇
#knowledgegate #GATE #sanchitjain

*********************************************************

[pendlivijender]

Profit/weight for objects are 5, 3.75, 2, 3.6, 3 so we have to take o1, o2 completely and fractional part of o4 which is (1*10)+(1*15)+(3/5*18) =35.8

[hridaysaharan]

Ans: 35.8

Sir, fractional knapsack is also comes under greedy problem.I have studied somewhere it is dynamic.0/1 is greedy

[thakur]

But KS weight is not given how to take obj's ??

[ayushiyadav]

15:30 Answer i.e P/W is 35.8, we'll pick obj1, obj2 fully and obj4 3/5 parts. obj3 and obj5 contains 0 parts as we don't pick them.

[Aakash-px]

Sir correct me if am wrong but the first question if we're greedy abt profits then we should choose whole 15kg object to have 24$ and 5/18 parts of 18kg object to have profit of 6.94$ so our max profit is 30.94 instead of 28.2$😅

[farhat-]

Sir chor ke pass itna time hota hai kya 😅

[xuv]

Sir if I buy your course can I login in phone and pc both?

[TargetMpset]

There is a condition mention in the question that only one unit of each item.
So i just try =
33.6
Is it right?

[jobandhillonvloger]

sir Travelling Salesman problem ke upar b ek vidio bna do pls

[mohitmaroliya]

Sir, is this a constraint to use any object once only ?

[jobandhillonvloger]

very helpful tutorial for mca student

[Hyper_codee]

greedy by profit == 33 like
greedy y weight == 19
geedy by profit/weight == 25
am I right or not

[chandandutta]

We have to take objects Q1, Q2, Q4 (5, 3.75, 3.6) . Therefore max profit= (10+15+10.8)= 35.8

[xuv]

Sir your contact number on app is not working