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

Related MCQs

• 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.
• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• A list which displays the relationship of adjacency between elements is said to be
• If a list contains no elements it is said to be
• If every node u in G is adjacent to every other node v in G, A graph is said to be _______.