Hashing - Collision Resolution with Linear Probing (Open Addressing)

This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
Hashing - collision resolution with closed hashing / open addressing
Collision resolution with linear probing
linear probing hashing example
analysis of linear probing hashing
individual displacements linear probing hashing
asymptotic distribution the cost linear probing hashing
exact distribution individual displacements linear probing
load factor linear probing
hashing linear probing example
linear probing hash table example
To study interview questions on Linked List watch • Programming Interviews...
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews...
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews...
To watch all Programming Interview Questions visit
• Programming Interviews...
To learn about Pointers in C visit
• Pointers in C (All you...
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial

[@sachinos]

in 2010 GATE exam i missed this linear probing question ,
i think it would be so easy now to students to understand thing from world of internet by sharing ... hats off to you...

[@andraspalfi5889]

Your videos are excellent and extremely helpful, thank you!

[@saurabhschool]

***** Thanks Andras, I am glad that my videos helped you!

[@naiche.]

Learned this in class today, was good to watch such a well done recap video. Thanks!

[@harikrishnanr4808]

helped me a lot to understand the concepts. Thank you for this great video:)

[@hmardah]

Thank you so much for your explaining. It is very useful for me to understand.

[@sadiaafrin8041]

thank you thank you thank you thank you, I love your video ^_^ u just saved my tomorrow's final exam :D

[@sumitkushwaha9532]

gud job.....nice tutorial
post something related to graphs....

[@JfhuTheJedi]

Thank you so much! this make sense now! Do you have a video for Double hashing?

[@mojganhtn6360]

thank you ... it really helps me

[@naviddaneshvaran5411]

It was so clear and comprehensive
Thanks alot

[@korml]

Great explanation :)
Thank you!

[@poshakajay]

What will be the time complexity of deletion? Because deletion will create a hole in the array, which needs to be filled by moving subsequent elements to preceding index otherwise some elements will be rendered inaccessible.

[@user-pr8vh7wv6j]

thank for your video, i study before exam ,i understand this video thank a lot my freind

[@Ash-ui7sp]

Could you please tell me the cost of insertion and cost of search for linear, quadratic, and double hash?

[@JohnnyFive]

fantastic video!

[@saurabhschool]

Thanks a lot John :)

[@redherring27]

Namaste, thanks 😀✌

[@saurabhschool]

redherring27 You are most welcome redherring27 :)

[@dulajsanjaya]

great explanation.!

[@akhileshparmar1061]

Very helpful hashing videos. Makes you learn simply and quickly.
I didn't understand one concept:
Why load factor should be less than .5 in leaning probing??

[@anotherally8320]

+Akhilesh Parmar Imagine if you had a hash table, with a load factor at about 0.9
Then when you try to add a new element to your table, it might not find a space at first, and so it will start searching through the table, and because you have a load factor at 0.9, this can end up taking a really long time, so it makes it ineffecient to have a big load factor.
This is how i understod it^^

[@siddharathghai3791]

Sir the answer you gave for successful search is not the same what we calculate from the derived formula ie
(1 /2)(1 + 1/ (1 − λ) )??

[@HK-no9wm]

Good job sir!

[@sharanbhat5248]

I have a doubt. You explained that if collision happens it will start searching for free space from start. I guess it will start from higher index than its matching index. for example 8 and 18 where both have modulus 8 so 8 is inserted into index 8 and 18 into next free index that is 9. Please correct me if I'm wrong.

[@deepanshukapoor]

thanx bro ....u saved me

[@ojeshpathak6201]

great lecture

[@PoIysaccharide]

really helpful!

[@animeshpathak3921]

i wrote something else in the exam even though i knew this techinque.why am i like this?

[@bhavneetsingh6893]

in first case you have taken m = 10
but my lecturer told me we should not take m close to 2 power n
Please tell me why

[@SunnyKumar-wp6wp]

Awsm teaching

[@madhusri4158]

Its so easy thankyou

[@goyo8456]

I'm guessing youre cramming as well lol

[@srisubhash8421]

is open hashing also collision resolution method?

[@anthmajor5326]

Thank you!

[@xjoel163]

Better than my prof :)

[@jiayilai4956]

How can I get the sildes?

[@elpeopuru3003]

thanks dude

[@stavrosfilippidis97]

Thanks a lot :)

[@Ottovillem]

Thanks man! :D

[@srisubhash8421]

how we will get i value??

[@ankitbartwal1043]

How to solve characters?

[@hotskulljr]

linkb up ?

[@SOAD525]

"Mobelow tin"

[@hassaansyed1064]

lol 25 % 11 is not equal to 4

[@SunnyKumar-wp6wp]

Little mistake cannot prove that that he is totally wrong...