#TestBook-algo

Question

The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash function

h(x) = (ord(x) - ord(A) +1)

If linear probing is used to resolve collisions, then the following insertion causes collision

• 1:Y

• 2:C

• 3:M

• 4:P

The given ans is 3.. but what is the approach and what do we mean by ord?

Answer 1

Yes The answer is correct ! 'M' causes collision

Ord means -order of the Alphabet (in this case)

To fill the hash table:

There are 10 entries ....

0,1,2.....9

Formula is h(x)=(ord(x)-Ord(A)+1)%10

Ord(A)=65 Ascii value

Similarly calculate ord of all elements and fill the hash table .

U will notice that element M will collide with element C at position 3.

Comments

thanks @Rishab Rao