863 views
4 votes
4 votes

Loading Question

1 Answer

1 votes
1 votes
First of all do the normal hasihng table. Remember search will be succesfull only if you are hased to any one of the * record in table.

Therefore, No of succesfull probes=Total no of probes for each of the record / Total records in table=13/8=1.6

we can be hashed to any of the entry and still we can have a unsuccesfull search,

Therefore No of probes for unsuccesfull search=

Total no of probes from each hash value to make a unsuccesfull search / Total capacity of table

=(8+7+6+5+4+3+2+2+3)/11=3.6

Related questions

0 votes
0 votes
2 answers
2
go_editor asked Mar 27, 2020
215 views
A hash function $f$ defined as $f(\text{key}) =\text{key mod}$ $7$, with linear probing it is used to insert the key $37,38,72,48,98,11,56$ into a table index from $0$ to...