3.4 Knapsack Problem | Greedy Method | Design and Analysis of Algorithms
ฝัง
- เผยแพร่เมื่อ 25 ส.ค. 2024
- 📝 Talk to Sanchit Sir: forms.gle/WCAF...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance Plus-2025: www.knowledgeg...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/91859512...
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: contact@knowledgegate.in
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_D...
▶️ Compiler Design: tiny.cc/kg_yt_C...
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_D...
▶️ Algorithms: tiny.cc/kg_yt_A...
▶️ Set, Relation, Function: tiny.cc/kg_yt_D...
▶️ Graph Theory: tiny.cc/kg_yt_g...
▶️ Group Theory: tiny.cc/kg_yt_g...
▶️ Proposition: tiny.cc/kg_yt_p...
#knowledgegate #GATE #sanchitjain
*********************************************************
For complete Algorithm, check out this video: th-cam.com/video/z6DY_YSdyww/w-d-xo.html
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
Ans: 35.8
Sir ,fractional knapsack is also comes under greedy problem.I have studied somewhere it is dynamic.0/1 is greedy
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.
13:26 loved the explanation
But KS weight is not given how to take obj's ??
35.8 is the answer
very helpful tutorial for mca student
Glad you think so! ❤ keep learning & supporting! Do visit our website www.knowledgegate.in for more amazing videos & contents👍
Sir , is this a constraint to use any object once only ?
sir Travelling Salesman problem ke upar b ek vidio bna do pls
35.8
Answer-35.8
It's done
There is a condition mention in the question that only one unit of each item.
So i just try =
1*10+1*15+(1/3*6)+(1/5*18)+1*3= 33.6
Is it right?
There is only one unit of each item available to take.....but there is not such constraint that says at least one unit of each item should be taken....so the answer should be 35.8 (taking 1,1 and 3/5 units of O1, O2 and O4 respectively.
Sir if I buy your course can I login in phone and pc both?
yes
Profile/weight =35.5 ans..
Homework-35.8
HW 35.8
10×1+15×1+3.6×3=35.8 👍🏻
15 +18 =33 is the maximum
Weight 9
homework Q-Max Profit=34
35.8 ✅
We have to take objects Q1,Q2,Q4 (5, 3.75, 3.6) . Therefore max profit= (10+15+10.8)= 35.8
Kaise hua 10.8
Sir chor ke pass itna time hota hai kya 😅
43.5
greedy by profit == 33 like
greedy y weight == 19
geedy by profit/weight == 25
am I right or not
50
28
Sir your contact number on app is not working
Dear Hardik, our team was on Diwali off, we have started working, you can contact us now, sorry for the inconvenience !
35.8
35.8
35.8