________ is the number pointers out of the node.
a) Fan-out of a node b) Root c) Tree d) Fan-in of a node
Order is the _____ number of keys/pointers in a non-leaf node.
a) Minimum b) Maximum c) May be minimum d) None of these
B+ tree contains __________
a) Index pages b) Data pages c) Both a and b d) None of these
In Binary trees nodes with no successor are called _______
a) End nodes b) Terminal nodes c) Final nodes d) Last nodes
Linked representation of binary tree needs _____ parallel arrays.
a) 4 b) 2 c) 3 d) 5
The minimum number of keys per record is _____ of the maximum number of keys.
a) ½ b) 1 c) 2 d) 2/3
The maximum number of keys in a record is called the ______ of the B+ tree.
a) Order b) Root c) Sub tree d) None of these
Number of records that can be stored in a B+ tree is __________.
a ) n d-1(n-1) b) n(n-1) c) nd-2(n-1) d) none of these
The depth of complete binary tree is given by ______
a) Dn = n log 2n b) Dn = n log 2n+1 c) Dn = log2n d) Dn = log2n +1
A binary tree whose every node has either zero or two children is called ______
a) Complete binary tree b) Binary search tree c) Extended binary tree d) Data structure
Sequential representation of binary tree uses _________
a) Array with pointers b) Single linear array c) Two dimensional arrays d) Three dimensional arrays
A blocked file takes up ______ space than an unblocked file because of internal fragmentation.
a) More b) Less c) May be less d) May be more
A sequence set is a set of _____.
a) Records b) Files c) Folders d) None of these
________ merge sort minimizes disk I/O cost.
a) Internal b) External c) Both a and b d) None of these
Polyphase merge in each pass performs only ____ way merge.
a) t-1 b) t c) t-2 d) t-3
_______ sort is the most efficient in terms of speed and utilisation of resources.
a) Merge b) Polyphase c) Cascade d) Prevention of naraka