L-6.7: Double Hashing | Collision Resolution Technique

0:00 - Double Hashing
8:57 - Advantages & Disadvantages

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[tshende]

That's how I completed whole series of hashing, , 🙂 thank you so much sir 🙂 ❤️

[muhammadsadaqatjanjua]

Kindly make a series on Unified Modeling Language(UML Diagrams) as with a huge demand for is seeking this platform to get directions in that regard. Thanks!

[bhavyakhakhar]

What a explanation sir.... I found you unnoticibly and now I am addicted and will be addicted to it due to your excellent explanation....
Thank you !!

[skhojayfarahaman]

You are my god sir. Best teacher in the world❤️❤️❤️.

[me]

I am a silent follower of your channel since early 2020. Got highest mark in SET CS (paper 2). Credit goes to your priceless videos Sir.

[itsnewday]

For the first time i have completed the syllabus. Aise faculty ho to sb ko subject easy lagega. A big salute to you sir

[AkashdeepDam]

Full hashing tutorial series is very very useful for me. Best way to understand hashing by watching this series. Thank You so much ❤️ Sir.

[shubhamsingh-xwtf]

Thank you so much for all the efforts sir. I am pretty confident in this topic that I was dreading for so long! May god bless you 🙏

[priyashaw]

Your explanation style is just awesome you

[prof.tarannumshaikh]

Excellent explanation. Concept got clear. Thank You.

[parthdogra]

sir cover TSP fast and other parts of dynamic prog too

[yashkumarcharde]

Thank you so much Sir for your Valuable teaching 🙏🙏 Finally completed the playlist

[wt]

Your understanding level is outstanding but wait wait
Formula for calculating position when collision occurs is wrong
Position=(original hash value +I*h2(x))mod table size
Please correct it if I m right

[kushalumarkar]

Really liked it, you explained it very easily. Please create video for B Tree.

[raman]

padhaya aacha hai, H bnane ka tarika thoda kezual hai

[creativitypoint]

For those wondering why he has used 8 in h2(k) let me clear your doubt:
Actually the standard is h2(k) and size of hash table must be relatively prime(both shouldn't have any common factor like 7 and 10, 20 and 33 etc). In this case he has made size of hash table a prime number i.e 11 rather than using 7 in h2(k) which is also true bcz 8 and 11 are relatively prime.

[aliyanahmed]

Sir u r the best teacher ever!! I completed the preparation of my final Exam and the credit goes to gate smashers. Thank u so much sir

[rahularyan]

Sir, aapki videos dekhne me kisi webseries jitna mza aata hai, shaam ko 6 bje start kri thi, tbse pta nai kitne videos dekhta chala gya ek ke baad ek, ab bhukh lgi hai toh uthna pda😂. Great videos sir🙏
Edit: 12 bjne me 15 min baaki hai abhi😂

[placementseries]

Sir in this vidoe you used 8 in 2nd hash function I think higher prime number less than table size is used so 7 should be used ???

[reshmasuresh]

Thank u so much sir🙏🏻💓...Sir plz try to give subtitle it will be very helpful for us