8.3 Double Hashing | Collision Resolution Technique | Data Structures and algorithms

I do my "hashing" (hash brown consumption) at McDonalds, Waffle House, IHOP, Perkins.... Double hashing to me means a double sized order.

Ma'am where is the video on properties...??🥺

Thank u 💓

shivant yaad kaara hai tumklo plz do talk to him

the table size is 10 which is not a prime so how can be double hashing can be implemented i think it's not possible

How to write the order of chaining method

Thank you so much!!

very nice jenny

would you please create a course for c#?
i think you are the only person who i can learn it from

so helpful
you are the best
thanks

I may be wrong, but if we start with i=0, than isn't that the same as the result of h1() function (which was already checked before we get to use h2() ) ???
That seems like we are checking if h1() twice.

But it was really good example.
Thank you for the lesson.

Probe means విచారణ or explanation

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
😀😀

Everyone like plss... 🙏💖🥰 for this wonderful explanation

Mam aap Hindi mai he acha pdhati to aur Smjh ache se aata hai aap Hindi mai padho plz

Thank u Ma'am

Amazing video ma'am. Thank you

Pahle kaana kaake class bolo mam your voice is very inaudible 😅

Thanks mam

I love you

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

Thank you

Thanks mam❤

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.

Great work!!

DAMN you are cute , ma'am

you are so beautiful so elegant just looking like a cow ma'am

🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰😍😍😍😍😍😍😍😍😘😘😘😘😘😘😘

Ma'am i think the way you got confused yourself while teaching this topic i think u should learn it first nicely your true fan Mohit

yes, your formula (u+v*i)%m is not valid , if i am following other one , then i get certainful answer .

Thank you jenny!!!!!!!

Very Good Explanation 👍

YOOOOOO

❤

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

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

whats m-1 for?

they will give h2(k) also ah mam

tell me how to find mod from calculator?

Mam are u married?

Best.asalways

So what happens if keys CANNOT be inserted? nothing right? they just wont be inserted?

got the A-Z same question which i'm searching

mam u are too cute

Just in one example mam had explained the depth of double hashing technique

Best channel.. Thank You ❤

Thanks 😊