Which of the following scenarios leads to linear running time for a r – McqOptions

MCQOPTIONS

1.	Which 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 diï¬€erent indices
C.	all keys hash to an even-numbered index
D.	all keys hash to diï¬€erent even-numbered indices
Answer» B. all keys hash to diï¬€erent indices

Discussion

No Comment Found

Related MCQs

In an Entity-Relationship Diagram “Diamonds” represents
In an Entity-Relationship Diagram “Ellipses” represents
Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here theonly functional dependencies are from dept name to the other attributes. This relation is in
is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
A functional dependency is a relationship between
If the complete execution of the transaction(s) takes the database from one consistentstate to the other then that property of transaction is called:
Problems occurs if we don’t implement a proper locking strategy
DFD stands for
We use name PL/SQL program objects and units.
Insertion of a large number of entries at a time into an index is referred to as__________ of the index.