Respected ma'am the work you are doing for us is really priceless. You are one of my favorite teacher. I have lots of love and respect towards you. Thank you ma'am for teaching me and guiding me. 😊❤️
Your video helped me learn double hashing. Thank you. I should add that I was quite amused when you started to solve for keys 13 and 7, ran out of probes, and could not find a position for it given the limitations of m-1. Thanks, Jenny.
Mam...aap ki vajah se main apni online classes k vakhth ache se so parahihu...aur free time me apke videos se topics cover karleti hu ....shukriya .nd god bless u
Mam you are amazing . i faced two problems yesterday and you were there to solve those problems. So i wrote a program for double hashing and i was not able to store one string in that. And you made it clear to me . Thanks.🙌
Very clearly explained, thank you! At 16:26 you mention that you will talk about properties of a good hash function in the next video. Was this video made and if yes can you please share a link to that video? I looked for a video called 8.4 Hashing hoping that would be it, but cannot find a video under that name
Ma'am I guess for 11 there should be PROBES=4 As we are using first h1(k) and due to collision we are going for h2(k) due to which we get PROBES=3 . Are we supposed to not consider the PROBE of h1(k) ? Please correct me if I'm wrong.
Thank you Jenny for this amazing lecture. Please I have two questions: 1. How did you get 10 as the value of m? 2. Why does 7 have a v value and 13 does not? Thanks, in anticipation of your response.
Ma'am I've noticed in your other closed hashing videos too, if we start the value of i from 1, then we can reduce one check. the colliding value will never be inserted in that case when i=0. Is my thought process correct?
you do have a point..but here we are going by the definition to see its implementation..also if we count the no. of steps in this case we get the no. of probes too. Yes..just to know the location its not necessary to check i=0 case..you are right about that :)
Mam why are we using division method everywhere I mean in all the resolving technique questions? What if a question comes without mentioning this? will the answer be same? I love your videos and I have cleared many of my doubts with the help of these videos. Thank you so much Mam
We use hashing to reduce search and insert time compkexity. You explained well how to reduce insertion time complexity, but how to search elements, you didn't tell, which was the main motto of this hashing concept. And also, why we are using quadratic probing, and double hashing, when linear probing is performing better than the latter two
for key 11, I think the total number of probes is 4 because in the first attempt we check the collision, which is considered to be a single probe, and there is collision after it, and then finding the location takes 3 probes so in total it will take 4 probes... am I thinking right? correct me if I am not please.
If the first hash function does not work, does that count as one probe? If you use the second hash function because of a collision, does the use of the second hash function count as the second probe?
How can the probe for key = 11 be 3? - First, we calculated u, which is 5, now we don't know whether 5 has some key or not, we will have to check it by iterating over the table. Hence, probe = 1 - Now, we found that hash[5] = 6, thus collision, therefore, calculating v, which is 4. Now calculating location using (5+4*0) % 10 = 5, now we will again check in the hash table is hash[5] == None, but again collision. Hence, probe += 1. - Now, i = 1, (5 + 4*1)%10 = 9, hash[9] != None, hence collision, but probe += 1. - Now, i = 2, (5 + 4*2)%10 = 3, probe += 1. - i = 3, probe += 1 - i =4, probe += 1, and we store the value at 3. Thus final probe should be 6. I am confused here. Please help me out.
Where is next video of hashing? As u told in video that we are seeing the properties of good hashing in the next video. Where is this? I didn't get it.
Respected ma'am the work you are doing for us is really priceless. You are one of my favorite teacher. I have lots of love and respect towards you. Thank you ma'am for teaching me and guiding me. 😊❤️
You have explained double hashing technique in depth.One of the best effort.
Your video helped me learn double hashing. Thank you. I should add that I was quite amused when you started to solve for keys 13 and 7, ran out of probes, and could not find a position for it given the limitations of m-1. Thanks, Jenny.
improving your thumbnails may spread your videos even more !
Ohh shut up you idiot
Ma'am, taken a great example, which shows different ways for failed insertions hats off ma'am!!!
It is a good example of how to choose better and more random has functions.
U r genius mam
Hopefully I wish and want u teach me in my front or real life ...
That's a awesome time for me
Nailed it....was founding everywhere till i stopped here.
Awesome explanation👏👏
Mam...aap ki vajah se main apni online classes k vakhth ache se so parahihu...aur free time me apke videos se topics cover karleti hu ....shukriya .nd god bless u
your lectures are awesome keep making these kind of lectures Ma'am.
25:38 We can tell the total number of probes as i value ranges from 0 to 9 hence each non inserted element will have probe value 10
I want become a teacher like u mam.. tat much inspiring.. u r my role model.. thank you.. and also i am ur fan..
excellent mam...aaapka videos dekke bahut confusion dooor ho jata...thnk u. sooo much mam for ur valueable videos..
Mam you are amazing . i faced two problems yesterday and you were there to solve those problems. So i wrote a program for double hashing and i was not able to store one string in that. And you made it clear to me . Thanks.🙌
Amazing mam..you helped me a lot without money..you are in my one of the favourite teacher in my life..love you mam..clever
Such A nyz..... Clear and Focused Lecture Lady!
Thanks a Lot ✌🏻
You are amazing 💗your videos are really very helpful.i watch your lectures on a regular basis. Take love from Bangladesh.
thanks alot mam ..this is surely one of the best DSA learning Channnel ...thanks for your existence on youtube
Very clearly explained, thank you! At 16:26 you mention that you will talk about properties of a good hash function in the next video. Was this video made and if yes can you please share a link to that video? I looked for a video called 8.4 Hashing hoping that would be it, but cannot find a video under that name
Ig she hasn't made that video.
Thank You so much Ma'am. I have completed DSA from here. Thanks
Simply great.. very nice explanation .. One of the best teacher I hv seen so far
Best teacher I have ever seen....I am from babasaheb bhimrao ambedkar university lucknow
At 13:34 when ma'am was gonna say 13 x 2 = Chabbis (26), I totally felt her !
Thank you so much for this explanation... Very clear and thorough! :)
very well explained, thank you didi.. lots of love
Just in one example mam had explained the depth of double hashing technique
Mam, your teaching method is really very excellent💯
love you mam..😃 one of the best teacher 🙏
Love you Monika sharma
So what about 13 and 7...we just leave those keys or some other process is involved? 25:43
Best Lecture For DS
Ma'am you really are a good teacher..
Please make the video about the best technique to use that you said to make in this video
you are the best mam. but please increase the quality of the video mam
thnx a lot mam..The work you are doing for us is helping us a lot.Your videos are very systematically arrranged and explaind 😇😇😇😇😇😇
Best channel.. Thank You ❤
Ma'am I guess for 11 there should be PROBES=4
As we are using first h1(k) and due to collision we are going for h2(k) due to which we get PROBES=3 . Are we supposed to not consider the PROBE of h1(k) ?
Please correct me if I'm wrong.
Plz upload rehashing also ...i like your voice ....know i want to learn that from u ...plz😭😭
Thank you Jenny for this amazing lecture. Please I have two questions:
1. How did you get 10 as the value of m?
2. Why does 7 have a v value and 13 does not?
Thanks, in anticipation of your response.
i start from 0 and end up at 9. if you count the index from 0-9 are 10=m. So m is the number of locations in the hash table.
would you please create a course for c#?
i think you are the only person who i can learn it from
Great....I don't know the words to express your skills,keep moving on...
Nice Example
thank you !!
Waiting for the properties of best hash function selection video.(continuation of this double hashing)
Ma'am I've noticed in your other closed hashing videos too, if we start the value of i from 1, then we can reduce one check. the colliding value will never be inserted in that case when i=0. Is my thought process correct?
yes
you do have a point..but here we are going by the definition to see its implementation..also if we count the no. of steps in this case we get the no. of probes too. Yes..just to know the location its not necessary to check i=0 case..you are right about that :)
Thank u Ma'am
Mam why are we using division method everywhere I mean in all the resolving technique questions?
What if a question comes without mentioning this? will the answer be same?
I love your videos and I have cleared many of my doubts with the help of these videos. Thank you so much Mam
mashallah ki samjhaya hai apbe very nice allah khosh rakhe apko
Very Good Explanation 👍
you're an amazing teacher , keep up ..
18:26 to 22:33 u r so hard working mam. must be the brightest student of your time :p
Found her on quora, she was the gold medalist.
Wow
I appreciate your videos very much...thank you very much
Mam if Hash function is not give like 2k+1 then we need to simply use ki% mod m Formula na?? To find keys location
😀😀
This lecture is very helpful for me
Your video was very much helpful....thanks for uploading your video
Thanks a ton Ma'am🙇♂️🙇♂️🙇♂️
Amazing video ma'am. Thank you
We use hashing to reduce search and insert time compkexity.
You explained well how to reduce insertion time complexity, but how to search elements, you didn't tell, which was the main motto of this hashing concept.
And also, why we are using quadratic probing, and double hashing, when linear probing is performing better than the latter two
Good explanation
Thank you very much. You are a genius.
Very well explained
Madam can we have about dynamic hashing.
And also I loved your teaching skills mam.
And I am from Andhra Pradesh.
Thank you mam
your expression was cute 😍3:28
ma'am, your teaching skills are FAB:-)
Best.asalways
Great work!!
Please make a video on rehashing
Thank you 😊
Great explanation mam👏
V.v.v clearly explain ❤️❤️❤️❤️❤️❤️😍😍😍😍😍
Super^100 Skill.
Everyone like plss... 🙏💖🥰 for this wonderful explanation
thank u tooooooo much it was easy discerption
Thank you jenny!!!!!!!
Life saver❤️❤️
so helpful
you are the best
thanks
one of the best thanks
You are the best mam 😘😘
Thanku so much mam ji
20:10 as we got repeated index value can we just stop checking ? as the sequence is going to repeat again
You're videos are great ma'am. I just want you to explain code for hashing, heap etc in the upcoming videos
please make a video on the properties of the good hash functions you have mentioned at 16:25
4 saal baad bnega ab
great work
Thank you so much!!
for key 11, I think the total number of probes is 4 because in the first attempt we check the collision, which is considered to be a single probe, and there is collision after it, and then finding the location takes 3 probes so in total it will take 4 probes... am I thinking right? correct me if I am not please.
super explaine thank u so much mam
Thank you
Excellecnt explaination..bt maam u skiped the topic cluster of blocks
Thank you for the lesson 🙏🏽🙏🏽
If the first hash function does not work, does that count as one probe? If you use the second hash function because of a collision, does the use of the second hash function count as the second probe?
How can the probe for key = 11 be 3?
- First, we calculated u, which is 5, now we don't know whether 5 has some key or not, we will have to check it by iterating over the table. Hence, probe = 1
- Now, we found that hash[5] = 6, thus collision, therefore, calculating v, which is 4. Now calculating location using (5+4*0) % 10 = 5, now we will again check in the hash table is hash[5] == None, but again collision. Hence, probe += 1.
- Now, i = 1, (5 + 4*1)%10 = 9, hash[9] != None, hence collision, but probe += 1.
- Now, i = 2, (5 + 4*2)%10 = 3, probe += 1.
- i = 3, probe += 1
- i =4, probe += 1, and we store the value at 3.
Thus final probe should be 6.
I am confused here. Please help me out.
In 1st lecture of hashing you have said us , the time complexity is O(1) how this is ?
Very good explain
Jenny you better than my teacher...
Your teacher wants to know your location 😂
Mam 7 can be inserted at the place 8 in hash table for i=2
There is some calculation error
Where is next video of hashing?
As u told in video that we are seeing the properties of good hashing in the next video.
Where is this?
I didn't get it.
Ma'am expecting video on clustering plzz!!??
Nice mam you are awsome 😍
Can you please upload multiplication method and universal method for hashing?
very helpful
Very helpful!! thanks a lot mam:
@13:04 maybe the probes are 4 if we count the search or u as well and not just the finction of v.
very nice jenny