[Solved] Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if

Computer Science Engineering (CSE)
Data Structures (DS)
Searching, Sorting and Hashing Technique...
Records R1, R2, R3,.. RN with keys K1, K...

Q.	Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if
A.	Ki <= Ki+h for 1<= i*h <= N
B.	Kh <= Ki+h for 1<= i <= N
C.	Ki <= Kh for 1<= i <= h
D.	Ki <= Ki+h for 1<= i <= N-h
Answer» D. Ki <= Ki+h for 1<= i <= N-h

View all MCQs in: Data Structures (DS)

Discussion

Related Questions

A B-tree of order 4 and of height 3 will have a maximum of keys.
What is the best case height of a B-tree of order n and which has k keys?
What is the average retrieval time when n keys hash to the same slot?
The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
In _______________all the records contain the same data items with the same amount of space.
__________is combining the records in two different sorted files in to a single sorted file.
If every node u in G is adjacent to every other node v in G, A graph is said to be _______.