524 views
3 votes
3 votes
Choose the false statement.

a) Internal hashing is implemented through the use of an array of records.
b) Multiple hsahing uses two or more hash functions.
c) Static hashing provides slow searching of records.
d) Extendible hashing provides good performance as file grows

1 Answer

Best answer
2 votes
2 votes
Internal Hashing: In this hash table is stored in main memory in which each slot conatin only one value.It is implemented using an array of records.(a) is correct

Multiple Hashing uses two hash functions for mapping key to its value(b) is correct

Static Hashing have fixed number of outputs for given hash function (ex mod 5 hash function will output only 0,1,2,3,4) So, Static Hashing is faster. (c) is incorrect.

Dynamic Hashing is used to avoid dis advantages with static hashing which fails as file grows.Dynamic hashing also called Extended Hashing.(d) is correct

 

So (c) is answer.
selected by

Related questions

0 votes
0 votes
0 answers
1
3 votes
3 votes
1 answer
2
Na462 asked Jan 26, 2019
1,896 views
0 votes
0 votes
0 answers
3
Parimal Paritosh asked Aug 30, 2018
606 views
Which tree has more number of levels for 'n' nodes - B tree or B+ tree? What's the reason behind it?
2 votes
2 votes
1 answer
4
Na462 asked Jun 29, 2018
692 views
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?