L-5.2: 0/1 Knapsack failed using Greedy approach
HTML-код
- Опубликовано: 22 фев 2020
- #0/1knapsack#dynamicProgramming#algorithm
👉Subscribe to our new channel: / @varunainashots
►Link of Greedy knapsack: • L-4.2: Knapsack Proble...
► Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RUclips: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
the word written on your T-shirt perfectly defines you
Most of the important thing you teach in very less time while other are teaching it in 30-40 min thats what makes you great
Sir please please continue this this is very very usefull content and i had join gate smasher for last 1 year ... it's very very good channel.. thank you so much sir......
Thank you sir for all these videos. Request you to upload the remaining videos
Thankyou bhai for this great explaination & you worked hard! Great work ❤️
Sir pls upload the rest videos...ur way of explanation is too good😊
thank you so much sir for such a beautiful explanation
You are doing amazing job ....it really helps us ... plz keep making videos...
Please upload new topics on DAA.. Your explanations are amazing.
Excellent 👍 explanation sir 👌, we are glad to have you in our LPU 🙏
LPU?
@@dakshchauhan6157 🥺
@@aaronmj6968 what?
@@dakshchauhan6157 Lalu prashad University
Thanks Varun. Watched this series in one single shot. Is there any plan to put remaining videos in this series ?
chota bhai hai varun? sir bolo
Sir when will you upload the remaining part of DAA....
We all are waiting...plz sir upload it soon
Wonderful explanation sir ..thank you...
Sir u teach very well I have watched all ur videos I just want u to upload 8 queen problem coz ur explanation is best
Yr brother bahot acha padhate ho mere doubt clear hote hai
Plz upload the full playlist of DAA.
Awesome explanation 👍👍😘😘🙏🙏🙏 thanku soo much sir .....but I have doubt do we need to sort weights in ascending order and in accordance with weight we also sort the profits......
Plz clear my doubt sir 🙏🙏🙏🙏
Thank You So Much Sir
Nice playlist
Please upload remaining portion it is very helpful
Please provide videos for other topics of daa as well !
Sir, upload the video for matrix chain multiplication, Assembly Line Scheduling, and Principle of Optimal Subtraction
Thank you sir...
Bahut badhiya sir g
Nice explaination
Sir, you teach really well ....plzz upload the remaining portion of DAA
nice explaination sir
one doubt sir- partial knapsack algo result- 20+60+{(2/4)*25}= 92.5
and brute force method result= 85
than how can it be better than partial knapsack algo.
bhaii...ye partial knapsack and 0/1 knapsack ko ekk similar samajh k confussion create n karo oo ekk alag method hai alag technique haai aur ye alag hai jiska aanswer alag alag hi aayega aur tum dono alag alag technique lagaa k same answer pane ki umid kaise rakh rahe ho....which is totally wrong
Sir plz upload the full playlist for DAA for University exams💘🙏🏾🙏🏾🙏🏾🙏🏾
लाल फूल
नीला फूल
Sir ji beautiful.....💛
Nice explanation sir
Nice explanation
Thanku, sir
2:16 thanks for making it clear...
Sir please upload remaining videos....we all are eagerly waiting...🙏
His shirt describes his work !!
Thankyou sir
Thank u too
awesome ❤
sir please upload remaining portion of ALGORITHM
Sir please uplaod maximum lectures on Design and Analysis of algorthms to
Thnks Sir
very nice sir
Amazing explanation sir
ruclips.net/video/VJbnWKUw-jw/видео.html
Sir please upload all the remaining videos..
Sir plz upload vedios on other concepts of daa sir..
Gud evng sir... Plz sir DAA ka complete syllabus videos upload kr di jiye...🙂
Hi sir,ap LCS Pblm, travelling salesperson pblm, matrix chain ,sum of subst pblm and multistage graph..in topic video upload kb karoge ap..
After selecting ob1 and ob3, only 2 weight is left to filled, as the capacity of the knapsack is 12. Can we select another ob1, since it is of weight 2? Are duplicates allowed?
please complete the course
and also start DATA STRCTURES complete
Sir, when will you upload the remaining portion of Algorithm. And please sir placement ke point se bhi pdhao.
We want this topic next video Sir
Good sir
Sir please Make a video on Subset sum problem and Longest Common Subsequence
Thank you sir
sir when will the next video come?
Ha sir ye topic ka next video
Nice
Sir please upload the next video. 🙏
Sirr can u make videos on backtracking and related topics...
Sir you said we are 1st using Greedy approach to solve this problem then you didn't add the remaining 2 part with the remaining object 2 you kind of mind both the approaches
upload video sir according to NIELIT Exam sir..
Can't we put object 1 (of 20 value & 2 weight) 6 times =120 profit?
Sir, when will you upload the remaining portion of Algorithm..
ruclips.net/video/VJbnWKUw-jw/видео.html
@@gyanimanushya2696 ye koi tareeka hai bheek mangne ka :/
Sir iske aage ka video banaiye.
Napsak problem and MCM, etc
Please upload the remaining lectures soon
Hello sir... sir dynamic problem k aur concept v video upload kar do.....
Sir when will u upload the rest topics...sir please upload immediately..
When u will upload the next video sir
sir plzzz upload full playlist
Sir please upload the rest soon.
partial knapsack problem discussed in greedy method was fractional knapsack ??
Aap DAA KI VIDEOS BAHUT DIN BAD BNA RHE HO
Sir I have a doubt.
Agar mera object 8 raha that's means 2^8
To usko binary mey represent karna to bahoot muskil ha to us time mey kya kare?
Sir, while solving above knapsack problem by greedy method, wouldn't we'll take object having weight 2, 6 times, so that it gives profit =120?
jero jero jero😂😂😂
Sir daa ka syllabus complete karwa do phir paper aa jayega so plz keep making videos on this
5:42 ob1 has weight 2, it can be stored in knapsack????
4:50 why can't we take 6 Nos of Object 1 ?
Sir plzz upload next video...
If following greedy approach then after fraction of obj2 can't we gain optiomal output
sir please upload the remaining portion soon
Next video?
Sir plz upload all vedio related to DAA
sir complete the playlist plzzzz
Sir why didn't u uploaded remaining lectures
Sir please uplaod remaining the videos ..
Hello sir
Next video nhi mil rha mujhe DAA ka 29 hi video h kya sir
sir nielit/NET k liye daa ka 29 video kya kafi hai????????? LCS Pblm, travelling salesperson pblm, matrix chain ,sum of subst pblm and multistage graph..plz upload FULL DAA syllabus video
Sir please upload all videos 🙏🙏🙏
Sir plz upload the remaining videos
Sir DAA se related or videos upload kijiye please
Sir when will you upload the 0/1 knapsack problem next part?
ruclips.net/video/VJbnWKUw-jw/видео.html
yeh course complete kb tk hoga??
What about fractional stuffing of the remaining item? The greedy technique allows that, right? Then, (25/4)*2 should be added and then the profit would become 92.5 . And that would be the optimal answer using greedy.
Correct me if I am wrong.
Kindly read the problem statement properly first.
It's 0/1 knapsack so fraction is not allowed
@@alhaquekhan938greedy approach is discussed first,where he said while explaining that half of the fraction of second object would have been added in the case of greedy approach , so first completing the profit obtained due to greedy approach comes out to be 92.5
why can't the objects be duplicated or replicated?
sir nimcet prepration se related kuch bta do
Hello sir... I m an ece student and want to conver cse syllabus just according to nielit exam.. Please specify whether we need to cover all lectures of DAA ?
Yes, of course, if you want to get a depth knowledge then you need to start from data structure very first, because it is base fore learning DAA...
Thanx sir..Sir apka koi paid course hai Kya?
No, sorry
Sir please upload the remaining portion of Algorithm....
Please upload remaining syllabus
please full course vedio
where is the dynamic part??????????????????????????????