Hashing Lab Program - Data Structures

[@BtechSkills]

Tqsm tomorrow i have ds lab exam

[@arunv7669]

is it ok just to implement a hash table without that collision logic?

[@Vandana.Teaching]

Hello.. Collision solution is also implemented in this code. while(ht[index] != -1) { index = (index + 1) % m; } In this, when the index value is not equal to -1 , it means that some element is already present here. so it checks if the next location ie., index+1 is free or not, if free then the next value gets stored here.

[@Vandana.Teaching]

I hope its clear now

[@arunv7669]

what about collision mam?

[@Vandana.Teaching]

Its implemented.

[@arunv7669]

@@Vandana.Teaching ok mam i was asking about the print statement, collision detected, do u want to continue.

[@arunv7669]

In exam if i implement the same code as u provided will they consider.

[@vandanau2636]

​@@arunv7669 Since it only says that you need to handle collison . So I have not written a separate print statement.

[@vandanau2636]

Yes bcoz it says internal handling of Collisions only..