Question 1 |

B+ Trees are considered BALANCED because

the lengths of the paths from the root to all leaf nodes are all equal. | |

the lengths of the paths from the root to all leaf nodes differ from each other by at most 1. | |

the number of children of any two non-leaf sibling nodes differ by at most 1 | |

the number of records in any two leaf nodes differ by at most 1. |

Question 1 Explanation:

Question 2 |

With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query:

"Get all records with a search key greater than or equal to 7 and less than 15"

is ____________.

"Get all records with a search key greater than or equal to 7 and less than 15"

is ____________.

7 | |

6 | |

5 | |

4 |

Question 2 Explanation:

Question 3 |

Consider a B+-tree in which the maximum number of keys in a node is 5. What is
the minimum number of keys in any non-root node?

1 | |

2 | |

3 | |

4 |

Question 3 Explanation:

Question 4 |

The following key values are inserted into a B+ tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items that can be stored in it. The B+ - tree is initially empty.

10, 3, 6, 8, 4, 2, 1

The maximum number of times leaf nodes would get split up as a result of these insertions is

10, 3, 6, 8, 4, 2, 1

The maximum number of times leaf nodes would get split up as a result of these insertions is

2 | |

3 | |

4 | |

5 |

Question 4 Explanation:

Question 5 |

Consider the B^{+} tree in the adjoining figure, where each node has at most two keys and three links.

Now the key K50 is deleted from the B^{+} tree resulting after the two insertions made earlier. Consider the following statements about the B^{+} tree resulting after this deletion.

i.The height of the tree remains the same.

ii.The node

(disregarding the links) is present in the tree.

iii.The root node remains unchanged (disregarding the links)1

Which one of the following options is true ?

Now the key K50 is deleted from the B^{+} tree resulting after the two insertions made earlier. Consider the following statements about the B^{+} tree resulting after this deletion.

i.The height of the tree remains the same.

ii.The node

(disregarding the links) is present in the tree.

iii.The root node remains unchanged (disregarding the links)1

Which one of the following options is true ?

Statements (i) and (ii) are true | |

Statements (ii) and (iii) are true | |

Statements (iii) and (i) are true | |

All the statements are false |

Question 5 Explanation:

Question 6 |

Consider the B^+ tree in the adjoining figure, where each node has at most two keys and three links.

Keys K15 and then K25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?

Keys K15 and then K25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?

1 | |

2 | |

3 | |

4 |

Question 6 Explanation:

Question 7 |

Which of the following is correct?

B-trees are for storing data on disk and B^+ trees are for main memory. | |

Range queries are faster on B^+ trees. | |

B-trees are for primary indexes and B^+ trees are for secondary indexes. | |

The height of a B^+ tree is independent of the number of records. |

Question 7 Explanation:

There are 7 questions to complete.

question no 4 answer will be C,not B