If both buckets are filled, one of the existing occupants is evicted and reinserted at its alternate location. If there is an item already at that location, it

If both buckets are filled, one of the existing occupants is evicted and reinserted at its alternate location. If there is an item already at that location, it is likewise evicted and reinserted. This process continues until an open space is found or a loop is detected. If there is a loop, the hash table needs to be rebuilt with more capacity or new hash functions.