retagged by
9,213 views
36 votes
36 votes
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
retagged by

4 Answers

Best answer
46 votes
46 votes

A critical statistic for a hash table is the load factor, that is the number of entries divided by the number of buckets:

Load factor $= n/k$

where:

$n =$ number of entries

$k =$ number of buckets

As the load factor grows larger, the hash table becomes slower, and it may even fail to work (depending on the method used).

Here, load factor = $\text{2000/25 = 80}$

edited by
22 votes
22 votes

load factor =total no element/total no of slots
=> 2000/25 = 80

7 votes
7 votes

Load factor =Number of elements can be loaded at particular slot = 2000/25 =80 = Also known as BUCKET SIZE

Answer:

Related questions

32 votes
32 votes
4 answers
1
go_editor asked Feb 14, 2015
8,947 views
Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...
25 votes
25 votes
8 answers
2
go_editor asked Feb 14, 2015
7,263 views
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is$65$$67$$69$$83$
42 votes
42 votes
12 answers
3
go_editor asked Feb 14, 2015
23,855 views
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
44 votes
44 votes
5 answers
4
go_editor asked Feb 15, 2015
10,741 views
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is i...