Can some one check my answer, and the last half I am not sure how to do it, It w
ID: 3779778 • Letter: C
Question
Can some one check my answer, and the last half I am not sure how to do it, It would be helpful if you could explain it to me.
1) The major advantage of hashed data structures is _____speed of access while searching________
2) In a non-perfect hashed structure, every key is mapped into a unique index into the array, True or False? __True___
3) When keys are non-numeric values preprocessing is always performed, True or False? ___true_
4) When two keys map into the same array index, we say a ___collision___has occurred.
5) The array of a non-perfect hashed data structure contains 769 elements. What element does the key 351,956 map into if no preprocessing is performed, and the division hashing function is used? _____________________________________
6) A hashed data structure will store a maximum of 4,352 nodes, the keys are numeric in the range is 0 to 999,999, and the node width is 60 bytes. (show your work)
a) Give the size of the primary storage area array if perfect hashing is used _________________
b) Give the size of the primary storage area array if non-perfect hashing is used _____________
c) Give the loading factor when the structure is full and perfect hashing is used ______________
d) Give the density when the structure is full and perfect hashing is used ___________________
e) Give the density when the structure is full and non-perfect hashing is used _______________
Explanation / Answer
1) The major advantage of hashed data structures is High speed of access while searching_the huge number of entries
2) In a non-perfect hashed structure, every key is mapped into a unique index into the array, True or False?
Answer:True
3) When keys are non-numeric values preprocessing is always performed, True or False?
Answer:True
Explanation:During the non-numeric values preprocessing each character of the key has to be fetched from memory to be fold shifted into the pseudo key
4) When two keys map into the same array index, we say a ___collision__at least one_has occurred.