Question

Question 17 0.5 pts Which would replace the missing statement when searching for an item using quadratic probing? Time Attem 1 Hoe HashSearch(hashTable, key) { 1 - bucketsProbed - bucket - Hash(key) % N while ((hashTable[bucket] is not EmptySinceStart) and (bucketsProbed < N)) { if ((hashTableſbucket] is Occupied) and (hashTable[bucket)-key -- key)) return hashTableſbucket) 1-1+1 MISSING STATEMENT bucketsProbed - bucketsProbed + 1 3 return null bucket = (Hash(key)+c1/i+c2/i*0)%N bucket - (Hash(key) +c1c2+i***)/N bucket - (Hash(key)+c1+i+c2/1*)/N bucket - (Hash(key) + c1'i+c2'i'n) %N E I o earch

Answer 1

4 bucket - C Hashckey) + G*i *G*ixi)%N

Quadratic Probing Given an ordinary hash function: h', an auxiliary hash function, the method of quadratic probing uses the hash function h(k, i) = (h'(k) + Ci + Czf) mod m, where i = 0, 1, ..., m-1, C and C2 0. • Advantage & Disadvantage: - Easy to implement • It suffers from a milder form clustering: If two keys have the same initial probe position, then their probe sequences are the same. 13