data structures using where is the size of the hash tablehc/( ( mod )and is the probe number that varies from to - thereforefor given key kfirst the location generated by [hc/(kmod mis probed because for the first time = if the location is freethe value is stored in itelse the second probe generates the address of the location given by [hc/( ]mod similarlyif the location is occupiedthen subsequent probes generate the address as [hc/( ]mod [hc/( ]mod [hc/( ]mod [hc/( ]mod mand so onuntil free location is found note linear probing is known for its simplicity when we have to store valuewe try the slots[hc/( )mod [hc/( ]mod [hc/( ]mod [hc/( ]mod [hc/( ]mod [hc/( ]mod mand so nountil vacant location is found example consider hash table of size using linear probinginsert the keys and into the table let hc/(kk mod mm initiallythe hash table can be given as - - - - - - - - - - - - - - - - - - - step key ( ( mod mod ( mod = since [ is vacantinsert key at this location - - - - - step key ( ( mod mod ( mod = since [ is vacantinsert key at this location - - - - - step key ( ( mod mod ( mod = since [ is vacantinsert key at this location - step - - key ( ( mod mod - -