96) A B-tree of order m has maximum of _____________ children

98) Match List-I with List-II and select the correct answer using the codes given below the lists:
List-I
A. Primary index
B. Clustered index
C. Secondary key index
D. Secondary non key index.
List-II
1. Dense
2.sparse

99) The order of an internal node in a B* tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node

100) A clustering index is defined on the fields which are of type

101) The language used in application programs to request data from the DBMS is referred to as the