L-5.3: 0/1 Knapsack Problem |Dynamic Programming |Recursive Equation |Recursion Tree Time Complexity
Vložit
- čas přidán 29. 06. 2024
- 👉Subscribe to our new channel: / @varunainashots
►0/1 Knapsack in Dynamic Programming: • L-5.2: 0/1 Knapsack fa...
0:00 - Recursive Equation
8:07 - Recursion Tree
► 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 CZcams: / 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
I am from tier 3 college and due to lockdown classes are close , i have learned all the concept of DAA and OS in my 4th sem , and Concept of DS in 3rd sem.
Thank you sir for these free stuffs.
Love you sir
Bhai 3rd sem m ye sb padh liya😮.
Mujhe Janna h abhi tu kha h
haa bhai batao kahan ho tum?
Hello kya apko ye pura smjh mai aaya😢
To mujhe ek doubt hai smjha dogge kya
@@JaySir_4U haa samjha dunga
Thank you very much Sir, you are helping millions of students. Words are not enough for the efforts which you are doing. You just relieve me out of a lot of stress. As soon as I see your videos it gives me a lot of confidence. Thank you very much Sir.
Sir, your conceptual understanding is outstanding. Thank you so much for the knowledge you are providing, for students like us. Please continue this method sir.🙏❤
Okay Sir, i've been watching your videos a lot lately and prepairing for my semester exams & i've to say, You're THE PERFECT teacher! The Way you explain things is Soo Good. Thank You so much sir!
Hi there. If you, the channel head, is reading this, please consider covering the rest of the topics as your explanation helps quite a lot. If you do, the topics to be covered are the rest of the standard problems on DP like Matrix chain multiplication, Optimal binary search trees, Reliability design. Further, please cover the topics under Backtracking and Branch and Bound algorithm design patterns. Thank you. Also, the videos you make focusing on why a certain approach fails to find the optimal solution for a given problem, like Greedy method for 0/1 Knapsack, is very appreciated.
00:06 0-1 Knapsack's recursive equation focuses on the two options for considering each object.
02:27 0/1 Knapsack Problem
04:37 Understanding the recursive equation for the 0/1 Knapsack Problem is crucial
06:32 Understanding the recursive equation for the 0/1 Knapsack problem
08:35 Explaining the recursive equation for the 0/1 Knapsack Problem
10:30 0/1 Knapsack Problem explained using Recursive Equation and Recursion Tree Time Complexity
12:14 Dynamic Programming reduces time complexity of 0/1 Knapsack problem
14:16 Time complexity reduced from exponential to n times m through dynamic programming
16:23 Dynamic programming saves time by optimizing computations
Merlin zindabaad 😂
Got it sir!!
Keep going!!
God bless you!
Okay, I'm learning a lot from you! thank you sir !
OK sir reach to recursion tree. Before watching your videos i was having no idea about subject but now i can say i am having enough knowledge. Had reach 48th lecture and still continuing.... DIL SE THANK YOU SIR🙌🙏
Varun I really like your way of teaching. Specially this playlist is too good 👍👏
Okay Sir, i've been watching your videos a lot lately and prepairing for my semester exams & i've to say, You're THE PERFECT teacher! The Way you explain things is outstanding. Thank You so much sir!
I had gone through the complete playlist in only 3 days and beleive me all the concepts explanation are damn good
I just searched for this video on the search bar and the notification popped up🤩
OK
Sir, Please upload videos on Branch & Bound
Thankyou so much sir for all your efforts. We adore you. Sir, you're doing a great work, helping us all students, may Almighty bless you sir.
i had gone through the playlist in 2 days, and it cleared all my concepts. Thanks a lot sir
Bhai muje tho 5 din laag gayee , Gazab yar tum tho bade heavy driver ho
@@fareedec3047 🤣😂😂😂
I always leaned from 3 semester from this channel and I love it
Hello Sir, I am trying to make tutorial videos in Bengali... Your teaching sense helping me a lot!🖤
Ok sir. Understood upto recursive equation. Thank you sir.
Finally understood the KS programming issues after watching 5 lectures. Thank you for sharing your knowledge.
1st Like.....You always explain the topic in superb manner which is understood easily....Thank you sir for your efforts!!!
@@sk4______515 Sharam krlo yaar thodi si... aise platform pe bhi tumhe sharam nhi.. Shame
OK👍👍😊😊smjh aa gya sir, thanks a lot🙏🙏👌👌👏👏
Ok Sir
Thank you so much for your lectures and God bless you and your family
Thanks sir..
Your lecture video helping a lot.
finally feeling i can understand the recursive code
Thanks for the videos.
Best teacher forever 😍thnkuuuu alotttt ❤️❤️
Ok Sir, Thank You Soo Much For This.
ok sir,
we are here..and thanks ....
Really great 🔥🔥🔥🔥🔥🔥
🎉Thank you so much sir.... really helpful video😊🤗
I am from Pakistan,, Sir ur great ,,your teaching methods different from others
❤
Thank you sir...also a request to upload a video on the Travelling Salesman Problem
Thank you for the amazing video . sir , be happy always
and OK reached
Thanks a lot Sir!
Ok sir ... Totally got it
Neatly done and well explained 😎. Thanks for the video
okay sir, very nice
Amazing explanation
ok..nd ur the best
Ok sir...you are A great teacher
💯 Wordy to watch
Thank you Sir now I'm am able to understand
Can you provide some more videos on problems using using dynamic programming without using brute force algorithm
Best sir
okay, thank you for putting such great efforts
great sir ji
Dear sir apke content apke teaching method itne jabardast hote hai ke like krna bhul jate hai bt dil se like hmesha hote hai 🙏🙏🙏
okie sir!
Ohk sir 😊
Ok Sir 👌! We learned and watch upto end❣️❣️
Great 👍
Sir please release all topics covering dynamic programming soon, Exams ahead
This playlist save my day thanks gate smasher❤
sir my new semester is going to start in a few days. I want your playlist of course "computer graphics". This course is in my semester and I always take your lectures for maximum courses. Please also make tutorials on this course "computer graphics " . really thankful to you.💖
Okay, got it sir
really nice
sir by only seeing your video for 3 days ,i secured good marks in dsa although question were hard but the way you explained every topic ,helps me to frame the answers in nice manner .Thank you sir🥰🥰🥰🥰🥰
All the best
great video.
#TechBlooded
Okay sir!!!
thanks sir
Ok sir & thnq sir
Thank you
Okay Sir! Got you
Best 🎉
great explaination your top fa here
Thank you so much sir!
Ok saved my time sir 😘
very good sir
Okay 👌
0-1 Knapsack's recursive equation focuses on the two options for considering each object.
00:06
✦
0/1 Knapsack Problem
02:27
✦
Understanding the recursive equation for the 0/1 Knapsack Problem is crucial
04:37
✦
Understanding the recursive equation for the 0/1 Knapsack problem
06:32
✦
Explaining the recursive equation for the 0/1 Knapsack Problem
08:35
✦
0/1 Knapsack Problem explained using Recursive Equation and Recursion Tree Time Complexity
10:30
✦
Dynamic Programming reduces time complexity of 0/1 Knapsack problem
12:14
✦
Time complexity reduced from exponential to n times m through dynamic programming
14:16
✦
Dynamic programming saves time by optimizing computations
16:23
u r the super genius 🥰
Thanks sir !!!
okkk. thnks for amazing playlist
OK
Recursive equation of 0/1 Knapsack Samajh me aa gaya , Sir
Congratulations for 1 million sir
Also sir, please do make a video on multistage graphs
Okay sir👍
👍 okie
Yes varun sir
so nice sir i love your all lecture
Tomorrow is my exam and I had started learning Ada from today morning from your channel. But because of the way u teach I think that I can do sth gr8 in the RGPV exam tomorrow 😅
Thank u for that efforts to make engineering studies so easy and cool ❤️
All the best
Same here 🙋🏻♀️😂
same 😁
@@GateSmashers tnx z
Ada nhi DAA hota h chamar
That same line when you repeat...! 😀
Done 👍🏻
Ok sir👍
Thank you sooo much sir...!!!!!!!!
all correct
Okay sir😄
sir, please release the dynamic prog. videos faster.
Avdu ra
@@yuvateja347 k musko bro
best sir best
Okayyyyyy Sir
Thank You so much!!!!!!!!!
Okay sir❤❤❤
Okay 🙏
bawa tumne pass kra diya
THANKYOU SIR
ok samaj aa gya
Thank you sir
8:19 ok sir , thanks alot
Ok sir understood
Okay!
Thanks
ok guru jee