figure hashing string using ordinal values with weighting figure collision resolution with linear probing occur howeversince this is often not possiblecollision resolution becomes very important part of hashing one method for resolving collisions looks into the hash table and tries to find another open slot to hold the item that caused the collision simple way to do this is to start at the original hash value position and then move in sequential manner through the slots until we encounter the first slot that is empty note that we may need to go back to the first slot (circularlyto cover the entire hash table this collision resolution process is referred to as open addressing in that it tries to find the next open slot or address in the hash table by systematically visiting each slot one at timewe are performing an open addressing technique called linear probing figure shows an extended set of integer items under the simple remainder method hash function ( table above shows the hash values for the original items figure shows the original contents when we attempt to place into slot collision occurs under linear probingwe look sequentiallyslot by slotuntil we find an open position in this casewe find slot again should go in slot but must be placed in slot since it is the next open position the final value of hashes to slot since slot is fullwe begin to do linear probing we visit slots and and finally find an empty slot at position once we have built hash table using open addressing and linear probingit is essential that we utilize the same methods to search for items assume we want to look up the item when we compute the hash valuewe get looking in slot reveals and we can return true what if we are looking for now the hash value is and slot is currently holding we cannot simply return false since we know that there could have been collisions we are now forced to do sequential searchstarting at position looking until either we find the item or we find an empty slot searching