recategorized by
1,062 views
2 votes
2 votes

A hash table with $10$ buckets with one slot per bucket is depicted. The symbols, $S1$ to $S7$ are initially emerged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is 

  1. $6$
  2. $5$
  3. $4$
  4. $3$
recategorized by

2 Answers

2 votes
2 votes

B is the answer, it asks about the number of conflicts u will get whenever you tried to search for an empty slot so that u can fill it.

let you want to insert 88 but the 8th poz is filled then u will go for probing which will take a max of 5 steps to find an empty slot thus it is the answer.

Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Apr 2, 2020
855 views
The average search time of hashing, with linear probing will be less if the load factoris far less than oneequals oneis far greater than onenone of these
2 votes
2 votes
2 answers
2
admin asked Apr 2, 2020
781 views
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
1 votes
1 votes
1 answer
3
admin asked Apr 2, 2020
683 views
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is$\Theta (\lo...