Register

hashing

1,394 views

1 Answer

Best answer
3 3 votes
unsuccessful means that you search a cell in your hash table to put an element in it but it was already filled.

so you now apply open addressing or chaining to resolve your problem

in this case last element is 72 so it should be placed inside 2nd row.

so Probe 1: unsuccessful 62 was there :(

now you apply linear probing

probe 2 : unsuccessful 83 was there  :(

probe 3 : unsuccessful 84 was there  :(

probe 4 : unsuccessful 95 was there  :(

probe 5 : unsuccessful 74 was there  :(

probe 6 : unsuccessful 23  was there  :(

probe 7 : unsuccessful 86  was there  :(

probe 8 : successful it  was empty so we can put 72 there :)

so 7 unsuccessful probe
• selected by
Voting & Accepting an answer helps improve the community
← Previous · arihant publicationNext → · [Self Doubt] [Previo...
← Previous in category · Data structureNext in category → · Regarding prims algo
Position:
Show:

Related questions

62 62 votes
5 answers 5 answers
25.5k
25.5k views
Arjun asked Feb 12, 2020
25,490 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...
7 7 votes
1 1 answer
273
273 views
GO Classes asked Jul 27
273 views
GO Classes DPP | GATE CS, DA | Data Structure | Hashing with Chaining
Insert the keys$47, 61, 36, 52, 56, 33, 92$in order into a hash table of size $7$ using:$h(k) = (10k + 4) \bmod 7$Each slot stores a linked list, and later insertions are...
4 4 votes
3 3 answers
238
238 views
GO Classes asked Jul 18
238 views
GO Classes DPP | GATE CS, DA | Data Structure | Search Length in Hashing
Which of the following factors affect the average search length in hashing?Load factor Hash function Collision resolution method Only I and II Only I and III Only II and ...
2 2 votes
1 1 answer
214
214 views
GO Classes asked Jul 16
214 views
GO Classes DPP | GATE CS, DA | Data Structure | Hashing
Consider the following statements about hash tables.$\text{S1}:$ The worst-case complexity of checking whether an object is present in a hash set is $O(1)$.$\text{S2}:$ T...