Ty😘. Just one doubt, initially you said that the bucket size should be a power of 2 and should decrease as we move right, but after removeing 1 from the left side it became 3,4,2,2,1.
Thats for the video Ma’m. I have a doubt. In the updating buckets example, the rearrangement of buckets is violating rule number 4 listed in your previous slides. The left most bucket has size 3 and you have gone to a new example without considering that case. Kindly help
Hi Madam, At 7:05 of the video, when a new bit 1 is added, old bit 1 is deleted so that N remains 24. Also the left most bucket's size has become 3. For the right most bucket, 2 1 size buckets are there (with the newly added 1). These 2 would be combined and make a bucket of size 2. How bucket with size 1 still there? Isn't that already added ti the previous 1 to make a new bucket with size 2? Thanks.
![Park Chen Yu [PCY] Algorithm](http://i.ytimg.com/vi/vSIPiXbFo_o/mqdefault.jpg)
![Flajolet Martin [FM] Algorithm](http://i.ytimg.com/vi/TG48mumSIaw/mqdefault.jpg)
Thank You mam, for such easy expalnation
Ty😘. Just one doubt, initially you said that the bucket size should be a power of 2 and should decrease as we move right, but after removeing 1 from the left side it became 3,4,2,2,1.
WOW great video!
Simple, to the point and covers all the important points clearly and quickly
helped me study for data streams for my big data final!
Thats for the video Ma’m.
I have a doubt.
In the updating buckets example, the rearrangement of buckets is violating rule number 4 listed in your previous slides. The left most bucket has size 3 and you have gone to a new example without considering that case.
Kindly help
Ok will explain
This is very useful and I thank you.. request to one more dacaying windows algorithm..
I want tamil vedio in DGIM Algorithm explanation please
Thank you ma'am. It's due to you my semester is saved.
All the BEST. Anything else..just ping on the website.
ma'am it's possible to get presentation in pdf format
Hi Madam,
At 7:05 of the video, when a new bit 1 is added, old bit 1 is deleted so that N remains 24. Also the left most bucket's size has become 3. For the right most bucket, 2 1 size buckets are there (with the newly added 1). These 2 would be combined and make a bucket of size 2. How bucket with size 1 still there? Isn't that already added ti the previous 1 to make a new bucket with size 2?
Thanks.
Raghunadh Nittala Yes...that is not considered as I emphasised on the additional bit on the right side. The left bit will be calculated as half.
Did I miss something? Why aren't there 2 buckets of size 4 in the last example @8:50?
your videos has helped me a lot....and the way you explain by taking example makes it more easy to understand
thank you so much
rishabh srivastava Thank you Rishabh.
this video was good and easy to understand !!
thank you so much...hope some videos for dwm also mam
Thank you,
Will surely work with DWM, after the BIG DATA ANALYTICS.
I still did not understand, why in the last example we had two buckets of each of size 2 and 1 while only one bucket of length of 8 and 4.
Rishik Mani Tripathi Can you ellobrate the problem..
2^0=1 so we took bucket with single 1
@@yashdeshpande8488 She said the bucket size should be a power of 2.So 2^0 dosnt concludes it.
you explained it very well.. plz make such wonderful video in future
Thanks, Parallel and Distributed System follows.
Really Helpful, Thank you madam
When you added an extra bit, the new left most bucket became size= 3. And you said that bucket should be in power of 2 I.e 1,2,4,8,..
Hi Shubham,
As the left most bucket has number count as 1, the complete input stream has to be re done.
Best of Luck.
I'm still confused about the re calculation of buckets.
Anyway, Thanks alot ma'am.
You did mention initially that bucket size has to be a power of 2, so how can we have a bucket with size 3?@@AnuradhaBhatia
Nice voice
Tq mam🤬
you are not Explaining the meaning of those words no wonder that you have less subscribers