figure collision resolution with quadratic probing figure collision resolution with quadratic probing this means that if the first hash value is hthe successive values are + + + + and so on in other wordsquadratic probing uses skip consisting of successive perfect squares figure shows our example values after they are placed using this technique an alternative method for handling the collision problem is to allow each slot to hold reference to collection (or chainof items chaining allows many items to exist at the same location in the hash table when collisions happenthe item is still placed in the proper slot of the hash table as more and more items hash to the same locationthe difficulty of searching for the item in the collection increases figure shows the items as they are added to hash table that uses chaining to resolve collisions when we want to search for an itemwe use the hash function to generate the slot where it should reside since each slot holds collectionwe use searching technique to decide whether the item is present the advantage is that on the average there are likely to be many fewer items in each slotso the search is perhaps more efficient we will look at the analysis for hashing at the end of this section self check in hash table of size which index positions would the following two keys map to searching