Gate CS-2009 Question Paper With Solutions

Q. 5 The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash
table of length 10 using open addressing with hash function h(k) = k mod 10 and
linear probing. What is the resultant hash table ?
Gate CS-2009 Question Paper With Solutions

Answer: (C)

Explanation:

Gate CS-2009 Question Paper With Solutions

Learn More:   Gate CS-2019 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here