Challenge Question

The question requires you to have a knowledge of data structures and some discrete math.

Let's assume we have a chained hash table that allows two entries per slot. The hash table has 16 slots. What is the probability that the eight insertion will have a collision?

If a slot is filled with one element and we need to add another element there, it is considered a collision. If it is full and we need to add an element there, it is a collision.

The implementation details are not important. I can certainly give you more information about should you care.

Question

Challenge Question

The question requires you to have a knowledge of data structures and some discrete math.

Let's assume we have a chained hash table that allows two entries per slot. The hash table has 16 slots. What is the probability that the eight insertion will have a collision?

If a slot is filled with one element and we need to add another element there, it is considered a collision. If it is full and we need to add an element there, it is a collision.

The implementation details are not important. I can certainly give you more information about should you care.

anonymous · Answer

So each slot allows two entries, but if you try to add an entry to a slot with only one element, that's a collision?

This seems contradictory.