L-6.6: Quadratic Probing in Hashing with example

0:00 - Quadratic Probing
5:30 - Advantages
6:16 - 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:
#quadraticprobing#collisionresolutiontechniques#hashing

[maamdu]

I have subscribed from my 7 accounts sir you are so hardworking

[agent]

Its crazy how an 8 minute video, that's in a language I don't speak, can teach me more on a subject than reading 100 pages out of a textbook. Amazing work.

[dkgeared]

Respect for your efforts man. Each video I watch makes me respect you even more. Thankyou.

[shubhamsingh-xwtf]

Your teaching methodology is straightforward and clear. It's really helpful in understanding difficult concepts ❤️

[Afgansdad]

Huge respect ❤sir from Pakistan🇵🇰 this video covers up 1 week work in 8 mins

[legolas]

Thank you sir for putting so much of effort for marking these kind of videos....keep on making them sir I am your regular viewer ...and I have viewed many videos on DBMS from your channel you🙏🙏

[pratimagaikwad]

Easy techniques...Thanks @gatesmachers to make us understands this in very clear language You are the best ....Keep it up with the good work and make us more more educated like you ...Thanks

[shivakumar-mdzi]

Thankyou very much sir. Respecting your effect...

[misskhan]

Your way of explanation is best in all YouTube CS channels. I almost downloaded your complete channel..thank you sir for providing such great lectures on all subjects of CS.

[nehaarora]

No words for your efforts brother. Huge respect and blessings.👌☺

[Lord_Assassin]

sir your videos are good but you have not made playlist of data structure it was very difficult for me to find videos

[ranazain]

Sir thanks u much #from Pakistan sir your each video is full of knowledge each and every concept is cleared and your way of teaching is so best

[poojakhandelwal]

very good and unqie way of explaintion thank u job but these ol topics are sufficient for jrf ugc net plz let me know

[mirzaasfand]

Ngl sir. First DLD, then COAL, and now DSA. I have learned so much from you guys. Your channel is simply amazing. Love from Pakistan ♥️

[devangprabhune]

A very intuitive example explained very well.

[pranaydas]

Sir, i'm a 2nd-year student it's my semester exam & u don't believe that i completed my whole syllabus through watching your
videos : #COA, #DIGITAL_LOGIC, #NUMBER_SYSTEM, #DATA_STRUCTURE, #HASHING, #ALGORITHM i watched all of this complete playlist.
everything sir, i have no words how to greed you, you r like a God for exam preparation, ur explanation skills or teaching skills has no word ❣❣❣❣

[codewithirfan]

I implemented this idea in C languge
and guess what, For key=62, i got the value 65538 😇
and found slot 5 in the hash table 😁

#include<stdio.h>

int hash_table[10];

int hash_function(int k)
{
return k%10;
}

int next_available_space(int index)
{
int i = 1;

while(hash_table[index] != -1)
{
index = index + (i*i);
index = index%10;
i++;
}

return index;
}

int main()
{
int keys[]= {42, 16, 91, 33, 18, 27, 36, 62}, i, key_size=8, index;

// Fill whole hash table with -1
memset(hash_table, -1, 10 * sizeof(hash_table[0]));

for(i=0; i<key_size; i++)
{
index = hash_function(keys[i]);

// check for next available space
int a = next_available_space(index);
hash_table[a] = keys[i];
}

// display hash table
printf("Index \t Key\n");
for(i=0; i<10; i++)
printf("%d \t %d\n", i, hash_table[i]);

return 0;
}

[riyapriya]

thank you so much sir, kindly request put the video in english and also linear hasing not there in your video which mean linear hashing split with new page and spliti with condition . could you please upload that topic also.

[ashishkadian]

sir, please share your daily routine so that we know what it takes to provide such amounts of quality content.

[mpanghal]

Sir please make video series on Computer Graphics
Please👋