a) Storage space is wasted
b) Changing the data in one spot will cause data inconsistency
c) In can be more easily accessed
d) Storage space is wasted & Changing the data in one spot will cause data inconsistency
Answer: d
Explanation: The database is always consistent and so there is no duplication.
Related Posts
Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
What is the best definition of a collision in a hash table?
Key value pairs is usually seen in.
A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
The goal of hashing is to produce a search that takes
The searching technique that takes O (1) time to find a data is
Join The Discussion