notes and place in the ith location of the table there are various methods available to obtain an alternative location to handle the collision they differ from each other in the way search is made for an alternative location the following are the commonly used collision handling techniqueslinear probing or linear open addressing in this methodif for an identifier xh(xiand if the ith location is already occupied then you search for location close to the ith location by doing linear search starting from the ( + )th location to accommodate this means you start from the ( + )th location and do the linear search till you get an empty locationand once you get an empty location accommodate there overflow chaining this is method of implementing hash tablein which collisions gets handled automatically in this method you use two tablesa symbol table to accommodate identifiers and their attributesand hash table which is an array of pointers pointing to symbol table entries each symbol table entry is made of three fieldsfirst for holding the identifiersecond for holing the attributesand the third for holding the link or pointer which can be made pointing to any symbol table entry the insertions into the symbol table are done as followsif is symbol to be insertedthen it will be added to the next available -entry of the symbol table the hash value of is then computedif (xithen the ith hash table pointer is made pointing to the symbol table entry in which is stored if the ith hash table pointer is not pointing to any symbol table entry if the ith hash table pointer is already pointing to some symbol table entrythen the link field of symbol table entry containing is made pointing to that symbol table entry to which ith hash table pointer is pointing toand make the ith hash table pointer pointing the symbol entry containing this is equivalent to building linked list on the ith index of the hash table the retrieval of attributes is done as followsif is symbolthen you obtain ( )and use this value as the index of the hash tableand traverse the list built on this index to get that entry which contains typical hash table implemented using this technique is shown belowlet the symbols to be stored are the hash function that you useh(symbol(value of first letter of the symbolmod nwhere is the size of table if ( ( ( then ( ( ( thereforethe contents of the symbol table will be the one shown in figure lovely professional university