Register

Hashing - Linear Probing

1,720 views
1 1 vote

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TOC :- Number of sta...Next → · Heap - Please explai...
← Previous in category · Number of InversionsNext in category → · Arrange the followin...
Position:
Show:

Related questions

61 61 votes
4 answers 4 answers
25.3k
25.3k views
Arjun asked Feb 12, 2020
25,288 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
1 1 vote
2 2 answers
738
738 views
vinayak_chandra asked Jan 31, 2025
738 views
Hashing (Collisions resolved by linear probing)
A hash table can store a maximum of ten records. Currently there are records in locations 1, 3, 4, 7, 8, 9, 10. The probability of a new record going into location 2, wit...
1 1 vote
1 1 answer
1.2k
1.2k views
Kaluti asked Nov 9, 2017
1,212 views
Hashing (Collisions resolved by linear probing)
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving colli...
2 2 votes
2 answers 2 answers
1.6k
1.6k views
Aditi Tiwari asked Dec 18, 2015
1,554 views
Hashing (Collisions resolved by linear probing)
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collision...