Data Structures Using C, 2nd Edition by Pearson

Advanced Data Structures 491

It may be observed from the examples given above, that there are chances that the records with dif-

ferent key values may hash to the same address. For example, in folding technique, the keys 123529164

and 529164123 will generate the same address, i.e., 816. Such mapping of keys to the same address is

known as a collision and the keys are called as synonyms.

Now, to manage the collisions, the overflowed keys must be stored in some other storage space

called overflow area. The procedure is described below:

n) When a record is to be stored, a suitable hashing function is applied on the key of the record and

an address ...