NIELIT 2016 MAR Scientist C - Section C: 30

Question

A hash table with $10$ buckets with one slot per bucket is depicted. The symbols, $S1$ to $S7$ are initially emerged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is 

• A. $6$
• B. $5$
• C. $4$
• D. $3$

Comments

Please provide the full question because hash table diagram is not visible

Answer 1

B is the answer, it asks about the number of conflicts u will get whenever you tried to search for an empty slot so that u can fill it.

let you want to insert 88 but the 8^th poz is filled then u will go for probing which will take a max of 5 steps to find an empty slot thus it is the answer.

Answer 2

this is not  full question

you can see here

https://gateoverflow.in/10905/gate1989-1-vii-isro2015-14

https://www.geeksforgeeks.org/isro-isro-cs-2015-question-14/