B+/Hashing Review

If our function is X % 10, where we would put 392?

(a)  

Which collision technique: uses a list for each bin to store multiple items?

• chaining

• linear probing

• quadratic probing

• double hashing

If our function is X % 5, where we would put 63?

(a)  

Using chaining, how many list items would be have to search through if we are searching for 120?

• 3

• 1

• 2

• 0

Answer explanation

3 (bin 0 has 3 items in the list)

Using Linear Probing, where would we insert 95 in this hash table? (function: %10)

• bin 6

• bin 7

• bin 2

• bin 5

Which collison technique: linearly searches for an empty bucket if a bucket is already full when trying to insert an item?

• chaining

• linear probing

• quadratic probing

• double hashing

How do you replace a value in a HashMap?

• hashMap.put(Key, Value)

• hashMap.put(Value, Key)

• hashMap.add(Key, Value)

• hashMap.offer(Value, Key

You need to know the value to remove something from a HashMap, true or false?

(a)  

Answer explanation

All you need to do is hashMap.remove(key)

Which collision technique: quadratically searches buckets from the full index until an empty bucket is found?

• chaining

• linear probing

• quatratic probing

• double hashing

If our hash function is (x+2) % 9, where would 66 be stored?

(a)