Computer Sciences > GATE 2026 SET-2 > Data Structures
The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k) = k mod 9. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is _______.
Correct : 3
Similar Questions
Which one of the following sequences when stored in an array at locations
A[1],...,A[10] forms a max-heap?
Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be...
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let...
Total Unique Visitors
Loading......