A key with hash value 10 joins a 7 slot table. Which slot takes it?

• slot 10
• slot 7
• slot 3

What does the hash function turn a key into?

• a slot number to jump to
• a sorted position in order
• a second copy of the value

The same key always hashes to the same slot.

Circle one:   True   False

Under linear probing, a key hashes to slot 4 but slot 4 is taken. What happens on insert?

• the taken slot is cleared first
• the key is dropped
• the walk moves forward to the next free slot

Two keys land in one slot under chaining. Where does the second key go?

• it overwrites the first key
• it joins the small list inside that slot
• it moves to a second table

Five keys hash into ten slots with one collision. Why does this still beat checking every entry?

• every key lands in slot zero together
• most lookups jump near the answer with only a short clash to settle
• collisions sort the keys for free

A friend inserts with probing but looks up by jumping only to the hashed slot. Lookups miss keys that are present. What is wrong?

• probing works for insert only
• the table needs wider slots
• lookup must repeat the same forward walk as insert

A table with 10 slots holds 9 keys and lookups crawl. One chain holds 5 keys. What is the diagnosis?

• the table is crowded, so clashes piled into long chains
• the hash values are too small to store
• chaining forgot the slot numbers