A hash table contains 10 slots and uses coalesced hashing to resolve collisions. The hash function used is key % 10. If the values 67, 23, 45, 11, 95 are inserted in the table, in what location would the key value 95 be inserted?
A. 7
B. 8
C. 9
D. 10
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion