COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
this situation is impossible
|
|
|
collisions
|
|
|
errors
|
|
|
the hashing algorithm is run again
|
Detailed explanation-1: -If there is any collision (i.e. two different elements have same hash value) then store both the elements in the same linked list.
Detailed explanation-2: -This condition is called Collision.
Detailed explanation-3: -A collision occurs when two keys are hashed to the same index in a hash table. The reason for occurring collision is that every slot in hash table is supposed to store a single element.
Detailed explanation-4: -A collision occurs when two keys get mapped to the same index.
Detailed explanation-5: -When hashing, two different files that creates the same result. This iscalled a collision. Collision resistance is the ability for a hash algorithm to avoid the sameoutput from two guessed inputs. Saltingmakes password hashes harder to decrypt or guess by addingadditional text to each password before it is hashed.