data structures using step key ( mod create linked list for location and store the key value in it as its only node null ( mod null null null null null null null step key ( mod insert at the end of the linked list of location null null null null null key insert at the end of the linked list of location null null null null null step key ( mod insert at the end of the linked list of location step null null null null null null step key step key ( mod ( mod create linked list for location and store create linked list for location and store the the key value in it as its only node key value in it as its only node null null null null null null null null null pros and cons the main advantage of using chained hash table is that it remains effective even when the number of key values to be stored is much higher than the number of locations in the hash table howeverwith the increase in the number of keys to be storedthe performance of chained hash table does degrade gradually (linearlyfor examplea chained hash table with memory locations and , stored keys will give to times less performance as compared to chained hash table with , locations but chained hash table is still times faster than simple hash table the other advantage of using chaining for collision resolution is that its performanceunlike quadratic probingdoes not degrade when the table is more than half full this technique is absolutely free from clustering problems and thus provides an efficient mechanism to handle collisions