Insert the characters of the string K R P C S N Y T J M into a hash table of size 10. Use the hash function
h(x) = ( ord(x) – ord("A") + 1 ) mod10
If linear probing is used to resolve collisions, then the following insertion causes collision
Y
C
M
P
This question is part of this quiz :