4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
HTML-код
- Опубликовано: 28 сен 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)
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 RUclips.
For students in a hurry learn the formulas and start the video from 34:40
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
Sir you can spend all your life from the blessings and appreciations of the fellow students around the world.
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 ....
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
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
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...
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!?? ❤️❤️❤️❤️
Sir taught me this concept within an hour when I was struggling to understand this since 3 days. Hats off to you sir
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
Words aren't enough to appreciate your way of teaching , you're just beyond of all PHD lecturer's who owned that degree just for name sake, but not teaching skills like you. I'm glad that, i've found my best teacher in engineering.
Sir, why did you stop uploading videos, all your videos inspire me to learn more 🥺🥺🥺🥺🥺
Sir I have exam in the afternoon ,you made my preparation sir .Bodacious way of teaching sir.
Your explanations are so good sir, my master's Univ teachers can't even teach to your simplicity and fun way.
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!
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👏👏
Sir please continue on your java series plz sir , you're seriously the best teacher . Keep up the good work
Assalamu Alaikum Sir there is no one like you in teaching field
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.
👌🙏
Thanks a lot for starting DP series, sir. One of the best RUclipsrs
Thank you for making video including unsuccessful probability as well
This is the Best Explanation available on this topic on internet so far.... thank you sir
Love to shop stock illustration! Great analogy, sir!
isn't null check also a comparison for square nodes.
Best Video on obst. I loved it.
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!!!
at 38:00 the x axis are the i values, not the j values as you've written. I think it was a mistake?
Thank You, Sir! This has been extremely helpful and very clear!
U do soo well sir
Please upload as many algorithm as u can..and some other video aslo..thank you so much
SIR YOU ARE A TRUE DIAMOND, YOU WERE BORN TO TEACH. 💎
May Allah blesses The great Abdul Bari Sir.
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
Return of legend....😊
34:38 this is for what all you guys came here for!
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.
Bahot sundar
Thanks for the sharing.
Isn't the B-tree order 3 (2 keys, 3 leaves) better in all scenarios?
Sir my college teacher teaches from your videos only
Best teacher! Keep up the good work sir..
Felt really lucky to bump into these courses, so very well explained and the way you relate computer science to maths is outstanding. God bless you sir for enlightening us all and thank you for all the efforts you took to create this for us
[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
Thank you sir for all videos on DAA
Now this is called an proper explanation
Sir can you please explain graph matching and edmond's blossom algorithm to compute augmenting path! please .......
Congratulations for 100k Subscribers Sir 😍😍
Sir can you make udemy videos for OS DBMS COA also.. Your explanation is all what I want to learn from.
Thank you for this well explained video :D
Explanation was very good, thank you sir
But did you understand the formula? What does c[i, j] represent?
you're the real mvp sir.
Why sir is not uploading videos nowadays ?,where can I see latest videos,you were my the only teacher, please upload 🙏
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 what should do when k is having 2 values in last
Thank you. You saved my life.
Amazing! Thank you!
Thank u sir you give the best for the students
Amazing explanation sir..... Thank you very much...........
you are the best best best best best teacherrr sir❤
w(11) should be equals to p(1)+q(1)=6
a goldmine in youtube
sir I have one doubt, In the video you derived the formula for total cost in binary search tree .... but it is different from what is written in cormen. Wouldn't it be (depth(di) + 1)*qi ?
Sir do post some sample questions at the end for us to solve
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.
How probably p, q is calulated?
Great Explanation...
Great Explanation, sir.
so do you have to find the successful search/unsuccessful search or its given?
Thank you very much sir
Sir please do more videos on algorithms we need more
How to take pi and qi values
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
bestie i love you actually
Great explanation.
thanks sir, u r very good teacher 💕
I am a bit lost because, I am not clear how the formula is derived (same situation in the previous videos too)
is it me or that this specific video has lags between vidoe and voice?
The logic of new videos is red t shirt imp concept
i am not able to understan why w is being added in the formula at 28:40
May Allah bless you. Thank you so much you are amazing
Thanks! You're the best!
Good explanation!
Asalamolicum sir, sir the cost of c[0,0] - c[4,4] can't be zero cauz we have already there unsuccessful probabilities so instead of "0" we will put unsuccessful probabilities
Thanks it gets your attention.
Lengthy lecture but interesting topic
thank u sir u helped me a lot!!!!!!!!!!!!!!!!!!!!!!
When you are calculating weights at 36:50, for W[i, j] where j - i = 0 and i >= 1 why haven't you added p1 and q1 and only considered q1. I am asking because you said the formula was pj + qj and you aren't considering pj.
Can you tell me why the formula is the way it is? What is the reasoning for it?
Sir, when we are calculating C[i,j] for i=j, why you took it as 0 instead of w[i,j]. I know there wont be any "K" to get minimum of C but shouldn't w[i,j] be left as final value?
Am i missing something?
@@abdul_bari Thanks Sir, I got your point. But as per Cormen et al., Introduction to Algorithms (3rd ed.), section 15.4 on optimal binary search trees, expected search cost for C[i,j] at i=j is equal to "Qi" not 0. If we apply this technique, final cost is increased to 40. So which is correct? 40 or 32?
Apologies in advance, if i misunderstood. I just started learning Dynamic Programming.
YOU ARE THE BEST
Example problem starts at 34:39
i love this man
great videos,,thanks sir
Use the function on obst to compute w(ij) r(ij) and c(ij),0
What is count, float, int, while? Why are they given as keys to the nodes? I thought keys were supposed to be integers.
your a legend thx
can you say how could we find such problem
Precious videos
May Allah be with u mashallah!
Please mr why don't u post other tutorial ??
Thank u very much
Very useful 🙏🇮🇳
the true legend
sir its not double u, its doublu W