recategorized by
2,237 views

3 Answers

4 votes
4 votes
since chained hash table is based on linked list . in case of collision new element will be added to the end of linked list which have no limit hence ans is D
3 votes
3 votes
There is no upper limit.
0 votes
0 votes
In Chained hash table, Linked list is used to add items, so it is depends on the memory size of system... So for now we can say we can store unlimited number of elements.

Related questions

1 votes
1 votes
2 answers
1
makhdoom ghaya asked Sep 16, 2016
2,096 views
Which of the following expression is represented by the parse tree ?$(A + B) ^{*} C$$A + ^{*} BC$$A + B * C$$A * C + B$
1 votes
1 votes
2 answers
2
makhdoom ghaya asked Sep 15, 2016
4,608 views
In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ?$1$ $2$...
2 votes
2 votes
1 answer
3
makhdoom ghaya asked Sep 15, 2016
5,177 views
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as !About $\log_{2} n$About $2 \log_{2} n$About $n \log...
0 votes
0 votes
2 answers
4
makhdoom ghaya asked Sep 15, 2016
5,839 views
What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree