Deletion in B-Trees - Practice GATE 2024 Fundamental Quiz

The order of a node in a B tree index is the maximum number of children it can have, suppose order of a B tree is 7 and it is initially empty. What is the maximum number of time a node can split as a result of 68 successive insertions________?

What is the minimum levels of B tree index required for 6400 key and order of B tree is 9 ________. (Order of B tree is the maximum child pointers on a B tree node)

Consider a table ‘T’ in a relational database with key field ‘K’. A B- tree of order ‘P’ is used as an access structure on K, where ‘P’ denotes the maximum number of tree pointers in a B- tree index node. Assume that K is 10 B long; disk block size is 512 B; each data pointer PD is 6 B long and each block pointer PB is 7 B long. The maximum value of ‘P’ in order for each B-tree node to fit in a single disk block is ______ (in integer).

Which of the following statements are correct with respect to the properties of B-Tree of order m.

I. Every node in a B-Tree contains at most m children.

II. Every node in a B-Tree except the root node and the leaf node contain at least m/2 children.

III. The root nodes must have at least 2 nodes.

IV. All leaf nodes must be at the same level.

The number of correct statements is?

What is the value of X+ Y if X be maximum number of nodes and Y be the maximum number of keys present in the B tree with order P=5 and level=4__________ where P is the Max no of pointers.

The best possible order (P) for non-leaf nodes in a B-tree when index file is built over Student relation with key as Student Id which occupy 6B of memory. It is given that block is of size 512 bytes and block pointer is of 9 bytes. Here an assumption is made that the size of record pointer is similar to the size of block pointer. What is the value of P if the best possible order is max no keys possible per node________.