is cyclic hashing possible??
ie.,
consider an array of size 5..
hence the index would be form 0 to 4...
so if we insert 53,63(takin the function as value mod size of the array)
the index 3 and 4 would be filled up...and when we insert some 54 again an error message "insertion not possible " would be shown...

but in the case of the cyclic hashing can the number 54 be inserted in the index 0 in case if its free??

and in case of cyclic hashing the error message is printed only if there is no space in the array.....?

>is cyclic hashing possible??
Yes, though as described it looks like you're trying to independently invent linear probing.