in DS recategorized by
541 views
2 votes
2 votes

The average search time of hashing, with  linear probing will be less if the load factor

  1. is far less than one
  2. equals one
  3. is far greater than one
  4. none of these
in DS recategorized by
541 views

2 Answers

0 votes
0 votes
load factor mostly let you know how full the hash table is. So, while in linear probing, the search will take time if the consecutive probes are there. Thus I think, we can go with option c.

1 comment

load factor for open addressing techniques cannot be greater than 1!
0
0
0 votes
0 votes

Load factor tells the average number of keys per slot.

That means,

  • if load factor is large, collisions become frequent.
    And as it is a linear probing.
    We may have to traverse around in the array to find the element.
     
  • if load factor is very less. That means there are more slots than keys.
    So we may get the element on the first search only.

That’s why Average Search Time will be less.

Answer:

Related questions