4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
Вставка
- Опубліковано 2 жов 2024
- Optimal Binary Search Tree using Successful and Unsuccessful Search Probabilities
PATREON : www.patreon.co...
Courses on Udemy
================
Java Programming
www.udemy.com/...
Data Structures using C and C++
www.udemy.com/...
C++ Programming
www.udemy.com/...
![4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula](http://i.ytimg.com/vi/Q4zHb-Swzro/mqdefault.jpg)
![4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula](/img/tr.png)
![[New] Matrix Chain Multiplication using Dynamic Programming Formula](http://i.ytimg.com/vi/_WncuhSJZyA/mqdefault.jpg)
Sir you can spend all your life from the blessings and appreciations of the fellow students around the world.
May you please fix the video and audio delay? It's very distracting and I can't really understand since it's not in sync.
My video works fine though
True, it really distracts a lot
Great explanation..
Hiiiii mam!!!!! You and sir are my favorite teachers!
ma'am aap bhi yaha se study krte ho 😏😏😏😏
😂😂
For students in a hurry learn the formulas and start the video from 34:40
I would encourage everyone to try out his Udemy courses. I am not getting paid for saying this, and I am just one of his students from the University of Michigan. May Allah bless The great Abdul Bari Sir.
Hello,is University of Michigan certificates are valid in resume?
@@prashanthi8492 yes they are!
aamen
I think you are getting paid for this.
Damn. You must be so lucky to be his student. I mean I'm too his student but on UA-cam.
Sir .Thank u very much for all videos on DAA....V all gave the best in our exams just because of ur videos....the way u thought is just perfect and very effective to us sir...Once again thank you very much sir..
Looking further for many videos ....
This videos are awesome ❤
Question: w[i][j] = w[I][j-1]+Pj+Qj
So, w[1][1] = w[1][0] + 3 + 3 = N/a + 3 + 3 = 6
but you go with w[1][1] = 3. Why?
I am also wondering this
If you got to know answer please let us also know in the comment.
36:20
yeah after all the prasing, he got me confused now, I hate myself cause i don't understand what he said
he wrote W00 as q value, as the formula is Wij = Wi,j-1 + pj + qj and pj which is p0 in this case is not defined as p starts from 1 not 0
Thanks sir. I had two questions
1. c[0,0] should equal to w[0,0] because of the formula "c[i,j] = w[i,j] + mini
Not Impressed Sir ...the toughest and the most important part of the problem was to arrive at the equation...and you have skipped the entire concept and have written the formula!!!And the entire 56 minutes video has content which everyone knows...
I am really fortunate to have a teacher like u sir for understanding such difficult topics just in few minutes each. I have also bought core Java course in Udemy platform only because of his way of teaching that reaches every student . Even I am thankful to u sir as u r responding to my doubts very quickly in Udemy . Thanks alot sir ....
Jdhxhxbx
I wish you could be the professor of Computer Science of Taiwan
19:20 you said for unsuccessful search we need to consider before level and multiply with probability
But you wrote 4*
It must be 3* right??
Ya..i had the same question
Once you have the recurrence relation (recursion formula), constructing the table is relatively straightforward. I'd like to find out - how did you come up with the recurrence relation (recursion formula) in the first place ? I don't think you went over that part in the video.
There are videos available covering the topic of recurrence relations. Check his algorithm playlists...
Sir, there is an audio delay starting from 24:40 . I guess you have cut out a part of the audio, but not the video. Could you please fix it. It would be helpful!
Sir, why did you stop uploading videos, all your videos inspire me to learn more 🥺🥺🥺🥺🥺
May Allah gives you the best. The way your explain is much better than a professor who is graduated form Ivy League universities . I bought his course in udmy and the materials became easy.
Is the material available in udemy course??
@@kusumaseera3753 Yes! His Udemy courses are just extraordinary, just like his YT videos. I'd definitely recommend this to anyone who wants to master Data Structures.
Sir one question: W is the summation of P and Q values. But while calculating w00,w11,w22... you considered only Q values, Why so?
Because j-i == 0 so there are no nodes in the tree so any search will always be unsuccessful. Seriously implicit big brain move
@@jswlprtk THANK YOU!!!
Dear Abdul Bari Sir,
Thank you So much for all of your videos , which you have provided that too for free in a time where education has certainly became a business may god give you more and more strength and all your dreams come true...#beautyofIndia
Yours Thankfully,
Abhinav,
Indore(M.P.)
How did c[i, j] suddenly become min(i < k
I think that is only for finding the cost but if you want to find the root then we have to apply the second one .
problem of OBST starts from 24:20
The formula was not explained properly, how did we arrive at the formula for c[i, j]? I only understood till c[0, n]. Someone please clarify this. And what does c[2, 4] even mean? c[0, n] means cost of a binary tree with n nodes given. c[2, 4], what does that mean?
cost means the amount of comparison you need to do minimise the operations from one key to another
Assalamualaikum sir G, have a course on "Automata". Watching from Kashmir University.
pok or iok
@@kaushalagrawal1620 does it really matter?
@@kailashks901 ooooooooooooooohhhhhhh
The most beautiful thing about you is you are so humble sir and keep smiling and teach concept thoroughly.😀Awesome content sir, thank you so much for spreading knowledge in world...
Got an exam tomorrow and here I am watching this ..Thank you so much sir
Agei bhi pad liya karo!!!!
audio is going ahead of the video sir....otherwise it is pretty good....
at 38:00 the x axis are the i values, not the j values as you've written. I think it was a mistake?
Bahot sundar
My lecturer for data structures, the best lecturer all the times.👍👍👍
Sir my college teacher teaches from your videos only
R14 = 1 🙄
isn't null check also a comparison for square nodes.
this lesson is so confusing. The explaination is short, and not clear. Why w[1,1] = q1 . Help please
Can you please upload a video of bipartite graph and augmentation concepts!
I just open ur video first like it and start listening , I know I will obviously like it . Who on earth are not impressed with ur videos!?? ❤️❤️❤️❤️
34:38 this is for what all you guys came here for!
Maximum subjects i have learnt from you in my engineering, today is 27march2022 and my engineering is completed in 2021🙂
Best Video on obst. I loved it.
Example Problem: 34:38
ABDUL YOU ARE THE MAN!
may Alllah bless you sir , very easy explanation ✨✨✨✨✨✨👌👌👌👌
Brilliantly Explained .. Cost + Weight & the root
sir in beginning i was unable to understand the concept but as the question starts and you start to explain from there I got the concept and also got myself stress free. Thanks for the video.
Sir plzzzzzzzzzzzzzzz make videos on automata computation .. theory of computation and automata ... Plzzzzzzzzzzzzzzz sir ... Ur way of learning is great .. thank you sir
Great explanation sir! Hands off to your teaching skills and also thankful to you for this valuable content. Helped me to understand every critical concept just within minutes.
👌🙏
Thank you so much to your channel🙏🙏🙏Your are helping students a lot in learning this subject. I'm really feeling thankful to you & your videos. That has helped me a lot in getting good Mark's in my semester result. I really felt so doubtfull before watching your videos because in my college they didn't explained this shortcut methods. After watching your videos I got confidence to write my exam & got good grade in that. Thank you so much🙏🙏🙏 I definitely suggest each & every student to use this platform👏👏
w(11) should be equals to p(1)+q(1)=6
Allah aapko hamesha khushh rakhe sir!!😃😃
thank you so much sir for helping me out , i was facing a lot of difficulty prior to now solving this problem..!!
That is the greatest explanation I've ever heard. Thank you so much! I appreciate your work 🙏🙏
Like here
Thank You, Sir! This has been extremely helpful and very clear!
How probably p, q is calulated?
Thank you for making video including unsuccessful probability as well
[SUGGESTION] the video is nice, but if there are chapters in the video then it makes it easy for learners at different levels to jump right to the section they want to
W[i,j]=qi+ { pi+1 to pj & qi+1 to qj}. May be wrong in the example so that it will add up pj while w00,w11,w33,w44 too.. kindly check once.
This starts to give me confusion now. why W[1,1]= q1, but not p1. Is that for the probabilitty of finding the first node?. Someone helps please
Sir could you please do a onething Sir please sir sir please update c++ programming language solutions,more problems add more questions,add more updates sir please sir please d within one month sir sir it will increase our efficiency your are my favourite sir please sir iam ready to pay 200$ if you update same course but please continue in whiteboard currently i think you may free please sir please in udemy
is it me or that this specific video has lags between vidoe and voice?
Thank you, you are my savior! :)
Христо Илиев I totally agree!
Why did they take probability level for unsuccessful search for greater than 40 as 4 and not 3 at 19.08 sec.....
c[i, i] should be equal to w[i, i], since each failure nodes still comes with cost.
Other than that, this video is great at demonstrating the procedure of finding the OBST. Thanks for this video!
Sir I am your big fan. Your explanation are unique. Please sir upload all video on data structures.
Should the cost of C[0][0],C[1][1],C[2][2],C[3][3],C[4][4] ={2,3,1,1,1 } respectively ?
No they all are = 0
Where is great explanation nothing here why the students come here because they didn't know how to do the problem and sir your doing short cut pls clear all the values how to take
Love to shop stock illustration! Great analogy, sir!
Hello Sir, can you please explain me why the formula for finding the number of possible BSTs for 'n' given nodes is given by ( 2^n C n )/ n + 1? What is the derivation for this? Does anybody else also ponder this? If anyone reading this comment has an idea, please explain. Thanks.
Assalamu Alaikum Sir there is no one like you in teaching field
Thanks for the sharing.
Isn't the B-tree order 3 (2 keys, 3 leaves) better in all scenarios?
Thank you for this well explained video :D
How to take pi and qi values
Sir, While finding value of C[ 0,0 ] , C[ 1,1 ]..... that time first term is not applicable because of value of K but W[i,j] we have to add which is not equal to zero. So why you are not considering that term? I got doubt here. Please reply sir.
I'm getting
C03 = 23 and r24 = 3 or 4.
Any other person getting same value like mine ?
Why sir is not uploading videos nowadays ?,where can I see latest videos,you were my the only teacher, please upload 🙏
If every college has a teacher like u than definitely wonders are made....in computer science
Advance part of algorithms
Nice explanation sir..(Y) #JAVAAID
I am a bit lost because, I am not clear how the formula is derived (same situation in the previous videos too)
a goldmine in youtube
Aslamalekum sir, awesome explaination
Sir please continue on your java series plz sir , you're seriously the best teacher . Keep up the good work
The previous videos are really clear, but since the binary search tree, I do not understand what is C[i,j], what is w[i,j], totally confused what happened...
Me Too😐
Sir taught me this concept within an hour when I was struggling to understand this since 3 days. Hats off to you sir
My teacher made this super boring 😂😂
it's so interesting
What if cost value are same for different keys
Then which should be taken as minimum and as a route value
astounding stuff...u r indeed the saviour....thx a lot sir
Mock interview on leetcode problem ua-cam.com/video/SISO0tVk1_c/v-deo.html
Sir your data structures courses is uploaded on UA-cam. And also the same person has provided a malicious link in every video. Please take some actions.
Can somebody tell me please why in first row we are using q(i/j) value alone
Greatest explanation ...
❤
Thank you very much sir
Sir can you please explain graph matching and edmond's blossom algorithm to compute augmenting path! please .......
You are the god’s gift to us…. This semester you helped us a lot, I have purchased your data structure course,and going to buy Java course, if you can create two or three courses of engineering subject, it will light the life of many…. No other academic teacher like you..
sir in the question p and q values are given in decimals how did you conv
ert them in to integers sir will you plz explain it sir?
Your explanations are so good sir, my master's Univ teachers can't even teach to your simplicity and fun way.
Awesome teaching nobody can teach like this..
Sir will we have the successful searches and unsuccessful searches in the question or not
Vedio helped a lot thanku
Can somebody please get me the derivation of the optimal binary search tree recursive formula urgently!!!
Congratulations for 100k Subscribers Sir 😍😍
so do you have to find the successful search/unsuccessful search or its given?
if it's level -1, why is he using 4 *.. int unsuccessfull search