recategorized by
3,421 views

2 Answers

2 votes
2 votes

The load factor of the non-empty hash table is the number of items stored in the table divided by the size of the table.

This is a decision parameter used when we want to rehash or expand the existing hash table entries.

Load factor= $\frac{\text{number of element in hash table}}{\text{hash table size}}$


$\therefore \textrm {Load Factor=$\frac{1000}{10}$}$

Load Factor=100

Option $(A)$ is correct.

A similar type of question was asked in Gate 2015 Set 3

edited by
1 votes
1 votes

$Load Factor ( \alpha ) $

= $\frac{Total number of elements }{Total number of slots}$

=$\frac{1000}{10}$

=$ 100 $

$\therefore $ Option A is Correct.

Answer:

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Dec 7, 2018
1,262 views
The smallest element that can be found in time ____ in a binary max heap.$O(n \log n)$$O( \log n)$$O(n)$$O(n^2)$
5 votes
5 votes
5 answers
2
Arjun asked Dec 7, 2018
2,078 views
______ to evaluate an expression without any embedded function calls.Two stacks are requiredone stack is neededThree stacks are requiredMore than three stacks are require...
1 votes
1 votes
1 answer
3
Arjun asked Dec 7, 2018
4,253 views
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree$O(n)$$O(n \log n)$$O( \log n)$ for search and...
2 votes
2 votes
3 answers
4
Arjun asked Dec 7, 2018
3,188 views
____ number of queues are needed to implement a stack$1$$2$$3$$4$