search
Log In
0 votes
813 views

A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ?

  1. $100$
  2. $200$
  3. $10000$
  4. There is no upper limit
in DS
recategorized by
813 views

3 Answers

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
0
@Sanjay Sharma Sir,Where is it mentioned that the hash table is implemented in the form of a linked list?
0
chained  hash table is mentioned which means hash table in form of linked list
3 votes
There is no upper limit.
0
@Digvijay Pandey,what if the hash table is implemented in the form of a circular linked list?Then how about it's size?
0

Use any data structure but asnwer is same we can add new element in circular linked list. right ?

Circular linked list get memory i heap area hence no limit. i think you confused between circular array in linked list. 

0
@Anu007,can you relate in terms of size? In case of circular linked list the address in last element points to the first one. In case of array I do agree it'll be incremental. BUt what if the element is inserted in the end in circular linked list. Say?
0
Thanks.:)
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 vote
3 answers
1
678 views
Which of the following expression is represented by the parse tree ? $(A + B) ^{*} C$ $A + ^{*} BC$ $A + B * C$ $A * C + B$
asked Sep 16, 2016 in DS makhdoom ghaya 678 views
1 vote
2 answers
2
1.6k 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$ $3$ $4$
asked Sep 16, 2016 in DS makhdoom ghaya 1.6k views
1 vote
1 answer
3
1.3k 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_{2} n$ About $2n$
asked Sep 16, 2016 in DS makhdoom ghaya 1.3k views
0 votes
1 answer
4
760 views
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
asked Sep 16, 2016 in DS makhdoom ghaya 760 views
...