Thank you very much for this video :-) I have a question: What would be the best order to insert values into a B+ tree to get the minimal height? (Let's say we have the values: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
Hi mam...there is no programming solution for the explanation kindly if possible give a hint on the programming side also. And your grip on the subject is fantastic.
why you keep the split point in the lower node (leaf) after moving it to the internal nodes?! is that a mistake?! Like 9 and 23 after inserting 8 and 25 at 8:30?
(11, 7, 10, 17, 11, 2, 3, 19, 11, 5, 6). b+tree (A) The maximum number of times leaf nodes would get split up as a result of these insertions (b) The height of the index (c) Assume that the root of the B+ tree index, created above, resides in the memory buffer (main memory), and each node of the B+ tree resides on a separate block in the disk. Total number of pointers in the B+ tree index = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (f) The number of buckets required to create a hash organization (dynamic) of the relation using the binary representation of the keys = if u possible pls explain me madam
It's not bad asking to teach in hindi bcz it may be his mother tongue and may be quite easy to understand, but bro, there are other channels which teach in hindi which are also quite good , u can refer them , like, apna college, code with harry, love babbar,...😊
Thanks a lot. Your explanation is more than my lecture college lecture.🤩👌👌👌
Thank you so much. Would have failed DS if not for you. Much appreciated, from Sri Lanka.
To the right we are adding the same value as well . Keep in mind all we gotta do is place all the elments in leaf nodes as well jo ki top pe hote hai.
interchange the order of lecture 8 and lecture 9.(thansk for helpful video)
Interchange the order of k and s.(most welcome) 😄
mam ap baht ache sikha te ho👏👏👏🙏
Explain on a complex problem, this video Help alot, Thanks
Yep Done with The topic:)
Thank You; And By the way mam U look pretty
Thank you Jenny! I like your accent.🤩
Excellent ma'am (Bangladesh)
Thankyou maam all ur lectures were helpful !!!!
Yaa done with these topic
Thank you
By the way u look pretty ✨
Amazing explanation mam ❤❤
U got a nice skill to explain terms in better and Easier way...Thanks.
It was Very Good explaination
Time saving! Thank u!
Thank you mam. This video series is very useful
Great Explanation!
B+ intro vedio kha h
Thanks mam.your teaching is excellent and understand easy
Final smile enough to see this video in loop mode🥴
Mam .. kindly put one separate video for learning Binomial heap and Fibonacci heap
Thank You Madam
Thankyou so much mam
Thank u so much ❤️
Thank you miss....
B+ intro vedio kha h
Thanks mam it's very useful to me ☺️
JazakAllah
Thanks
Thanks 👍
Just wow 😳
Thanks mam
Please do upload videos on Segment trees and other advanced Data structures as well.
thank u
Thank u mam all doubt clear ☺️ Mam can u make lecture on Bulk loading B+ tree ..
Mam pls make a video on "patricia" Asap
احبك شكرا
Tqq mam
very good explanation ma'am
Great explanation
Ma'am make video on Linked List Please!
Already uploaded, pls check playlists
@@JennyslecturesCSIT ya, i got that! thanks,
Thanks dear mam 😊
U r so much cute 😅
@code fire trko kya m pdhai kru ya nhi ..apne kaam s kaam rkh
Mamm plzz give lecture on c++
Middle element is 23 at last
Comparison and tournament tree plz
Ma'am kindly make a video for B* tree
Thank you very much for this video :-)
I have a question: What would be the best order to insert values into a B+ tree to get the minimal height? (Let's say we have the values: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
Hi mam...there is no programming solution for the explanation kindly if possible give a hint on the programming side also. And your grip on the subject is fantastic.
I love you
❤️
if it's possible to make video on topic linked list.. plzz
working on it
love you too............
Ich bin schtat
Ma'am please make video on Threaded Binary Trees(TBT).
Mam I want Topological sorting concept please mam
Already uploaded. U can check out data structures and algorithms playlist
Mam plz tell of order 3 in b+ tree
💕💕🤩
Why did you write 23 two times
G 240
B+ intro vedio kha h
why you keep the split point in the lower node (leaf) after moving it to the internal nodes?! is that a mistake?! Like 9 and 23 after inserting 8 and 25 at 8:30?
i have also same doubt i think if we write only in internal node not in leaf so it will be correct
Bhai please do some research on B tree and B+ tree 😊 then you will know the reason@@ABPMEMES-nq9sq
@@ABPMEMES-nq9sqAnd it's not mistake it is application of B+ tree watch any difference between B tree and B+ tree
When add 23 ,should we consider minimum child =3 ? If it so root should be 7,10. Pls explain it
Ma'am make a video on 'Threaded binary tree'
plz
yaar kitni kaata piti kru kopy ki band baj gyi h
How come there are 6 children when the maximum number of children is 5?
It's an intermediate stage only for representation after the process we see the result
Mam hindi m bolke hi padha diya karo jyada sanjh aayega
(11, 7, 10, 17, 11, 2, 3, 19, 11, 5, 6). b+tree
(A) The maximum number of times leaf nodes would get split up as a result of these insertions
(b) The height of the index
(c) Assume that the root of the B+ tree index, created above, resides in the memory buffer (main memory), and each node of the B+ tree resides on a separate block in the disk. Total number of pointers in the B+ tree index =
(d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 =
(d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 =
(f) The number of buckets required to create a hash organization (dynamic) of the relation using the binary representation of the keys =
if u possible pls explain me madam
Can't we perform creation after sorting the elements given in question??
b tree and b+ tree comparison video?
What is difference between b-tree and b+tree
Zap
Why don't you teach in Hindi ?
Knowledge is not restricted to north hindi speaking idiots😂
Bruh
Paper hindi me likhega kya
@@pladimirvutin749 lol 😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😆😂😂 kya baat kahi yar
It's not bad asking to teach in hindi bcz it may be his mother tongue and may be quite easy to understand, but bro, there are other channels which teach in hindi which are also quite good , u can refer them , like, apna college, code with harry, love babbar,...😊
sexy
Mam sunder to bahot hai app😊 shadi hogye hai?
Excellent explanation , thank you so much mam
thanks a lot mam
Thankyou
B+ intro vedio kha h
Thank u mam
Thanks mam