827 views

1 Answer

Best answer
3 votes
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

Related questions

0 votes
0 votes
0 answers
1
rsansiya111 asked Mar 12, 2022
361 views
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal ...
0 votes
0 votes
1 answer
3
Ram Swaroop asked Jan 27, 2019
1,263 views
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...
0 votes
0 votes
0 answers
4
Rahul_Rathod_ asked Dec 28, 2018
413 views
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1