Register

NIELIT 2016 MAR Scientist C - Section C: 56

• recategorized by
870 views

2 Answers

1 votes
1 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.
User Avatar
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.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
admin asked Apr 2, 2020
1,089 views
NIELIT 2016 MAR Scientist C - Section C: 30
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 $6$ $5$ $4$ $3$
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...
User Avatar
2 votes
2 votes
2 answers
2
admin asked Apr 2, 2020
801 views
NIELIT 2016 MAR Scientist C - Section C: 31
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
User Avatar
1 votes
1 votes
1 answer
3
admin asked Apr 2, 2020
712 views
NIELIT 2016 MAR Scientist C - Section C: 49
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 (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$
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...
User Avatar
Link Copied!