B Trees Introduction GATE 2024 Fundamental Quiz

In B-tree, order P is maximum child pointers per B-tree node. The minimum number of levels of index is required to store 540 distinct keys in B-tree with order P = 5 are ______(In integer)

Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record P_R=7 bytes long. A file has 30000 employee records of fixed length, each record is fixed size of 100 bytes, then the number of file blocks 'b' required is_____

If the order of the B tree is 199, the number of levels (including the root node) we need to store 69,99,996 index records is ______.

Consider a B-tree in the given figure, where each node has atleast 2 and atmost 4 keys.

Keys 6 and 21 are inserted into this tree in that order. The number of nodes (disregarding the links) present with exactly same structure given below in the tree after the two insertions is _______.

Which of the following is true?[Multiple Select Question]