COLLISION RESOLVING IN HASHING

OPEN ADDRESSING(LINEAR PROBING)

WITH AND WITHOUT REPLACEMENT
Muhammad Wasim 17-NTU-1104
Haseeb Zia 17-NTU-1084
 COLLISION RESOLVING IN HASHING

• Hash Table is a data structure which stores data in an associative manner.

In a hash table, data is stored in an array format, where each data value has
its own unique index value. ... Thus, it becomes a data structure in which
insertion and search operations are very fast irrespective of the size of the
data.

• When the hash value of a key maps to an already occupied bucket of the hash
table,it is called as a Collision.
COLLISION RESOLUTION TECHNIQUES
 Data[size] Flag[size] Chain[size]
Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] Data[2] 0 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] Data[5] 0 Data[5] -1
Data[6] Data[6] 0 Data[6] -1
Data[7] Data[7] 0 Data[7] -1
Data[8] Data[8] 0 Data[8] -1
Data[9] Data[9] 0 Data[9] -1
 INSERT=5

Data[size] Flag[size] Chain[size]

Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] Data[2] 0 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] 5 Data[5] 1 Data[5] -1
Data[6] Data[6] 0 Data[6] -1
Data[7] Data[7] 0 Data[7] -1
Data[8] Data[8] 0 Data[8] -1
Data[9] Data[9] 0 Data[9] -1
 INSERT=16

Data[size] Flag[size] Chain[size]

Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] Data[2] 0 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] 5 Data[5] 1 Data[5] -1
Data[6] 16 Data[6] 1 Data[6] -1
Data[7] Data[7] 0 Data[7] -1
Data[8] Data[8] 0 Data[8] -1
Data[9] Data[9] 0 Data[9] -1
 INSERT=12

Data[size] Flag[size] Chain[size]

Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] 2 Data[2] 1 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] 5 Data[5] 1 Data[5] -1
Data[6] 16 Data[6] 1 Data[6] -1
Data[7] Data[7] 0 Data[7] -1
Data[8] Data[8] 0 Data[8] -1
Data[9] Data[9] 0 Data[9] -1
 INSERT=15

Data[size] Flag[size] Chain[size]

Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] 2 Data[2] 1 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] 5 Data[5] 1 Data[5] 7
Data[6] 16 Data[6] 1 Data[6] -1
Data[7] 15 Data[7] 1 Data[7] -1
Data[8] Data[8] 0 Data[8] -1
Data[9] Data[9] 0 Data[9] -1
 INSERT=25

Data[size] Flag[size] Chain[size]

Data[0] Data[0] 0 Data[0] -1
Data[1] Data[1] 0 Data[1] -1
Data[2] 2 Data[2] 1 Data[2] -1
Data[3] Data[3] 0 Data[3] -1
Data[4] Data[4] 0 Data[4] -1
Data[5] 5 Data[5] 1 Data[5] 7
Data[6] 16 Data[6] 1 Data[6] -1
Data[7] 15 Data[7] 1 Data[7] 8
Data[8] 25 Data[8] 1 Data[8] -1
Data[9] Data[9] 0 Data[9] -1