a) Binary trees b) Stacks c) ...
View QuestionWhich of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
a) All keys hash to same index b) All keys hash to ...
View QuestionWhat is the best definition of a collision in a hash table?
a) Two entries are identical except for their keys b) Two entries with different data have ...
View QuestionKey value pairs is usually seen in.
a) Hash tables b) Heaps c) Both Hash tables and Heaps
View QuestionConsider 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.
a) 8, _, _, _, _, _, 10 b) 1, ...
View QuestionThe goal of hashing is to produce a search that takes
a) O(1) time b) O(n2 )time c) O(log n ) time d) ...
View QuestionThe searching technique that takes O (1) time to find a data is
a) Linear Search b) Binary Search c) Hashing d) ...
View QuestionIf h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
a) Less than 1 b) Less than n c) Less than m
View Question