The space overhead in dynamic hashing is ________ than that of static – McqOptions

MCQOPTIONS

1.	The space overhead in dynamic hashing is ________ than that of static hashing
A.	More
B.	Less
C.	Equal
D.	None of the mentioned
Answer» C. Equal

Discussion

No Comment Found

Related MCQs

Which of the following hash function classifies data into the highest number of buckets ?
Which of the following hash function classifies data into least number of buckets?
The form of dynamic hashing that avoids the additional level of indirection is called as _________
WHICH_OF_THE_FOLLOWING_HASH_FUNCTION_CLASSIFIES_DATA_INTO_LEAST_NUMBER_OF_BUCKETS??$
Which of the following hash function classifies data into the highest number of buckets ?$
Which of the following is an issue that needs to be considered while choosing an indexing technique?
Hash structures are not the best choice for which of the following?
The form of dynamic hashing that avoids the additional level of indirection is called as _________
Which of the following is a disadvantage of the dynamic hashing structure
The space overhead in dynamic hashing is ________ than that of static hashing