Because in theory you want to map an indefinite number of keys into a finite sized hash table. So suppose the keys are people's full name, and the hash function can turn each name into a number. There is an almost endless number of possible names, but if the hashed value is only 8 bits, or 256 values, there is a chance that more than one name will collide with another name . If that happens you might create a linked list to search through for each bucket.
It was really informative .Thanks a lot sir !!
He explained it to such an extent that I forgot how indexing works in an array. Thanks for degrading my knowledge and wasting my time. :)
why bucket/page can contain multiple search keys?
please someone answer.I am new to CS courses
assume you have two search keys with the same hash value. these two keys will then go to the same element of the hash-table (overflow).
Because in theory you want to map an indefinite number of keys into a finite sized hash table. So suppose the keys are people's full name, and the hash function can turn each name into a number. There is an almost endless number of possible names, but if the hashed value is only 8 bits, or 256 values, there is a chance that more than one name will collide with another name . If that happens you might create a linked list to search through for each bucket.
Accent thicker than rosie o'donnell herself
not so bad, I can understand :)
there must be areason why guys from India are the only ones that can in fact explain everything in CS :)
MUCHA ASI RAKHI HOWI HA JASA 1O BACHA LAGTA HO
unable to read what you have written.
very poor explanation....
Not sure how he made it to IIT. Usually profs speak amazing English at such premier schools.
I can understand him, no problem
that's your misconception :)