Exercise: Questions on B and B+ Trees


Questions on B and B+ Trees : Question 1 :
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? (GATE CS 2010)

1
2
3
4
Show Answer
Questions on B and B+ Trees : Question 2 :
Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations?

Database relations have a large number of records
Database relations are sorted on the primary key
B-trees require less memory than binary search trees
Data transfer form disks is in blocks.
Show Answer
Questions on B and B+ Trees : Question 3 :
B+ trees are preferred to binary trees in databases because (GATE CS 2000)

Disk capacities are greater than memory capacities
Disk access is much slower than memory access
Disk data transfer rates are much less than memory data transfer rates
Disks are more reliable than memory
Show Answer
Questions on B and B+ Trees : Question 4 :
Which of the following is FALSE about B/B+ tree

B/B+ trees grow upward while Binary Search Trees grow downward.
Time complexity of search operation in B/B+ tree is better than Red Black Trees in general.
Number of child pointers in a B/B+ tree node is always equals to number of keys in it plus one.
A B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes.
Show Answer
Questions on B and B+ Trees : Question 5 :
A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?

3
4
5
6
Show Answer
Questions on B and B+ Trees : Question 6 :
The order of a leaf node in a tree B+ ? is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?

63
64
67
68
Show Answer
Questions on B and B+ Trees : Question 7 :
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?

24
25
26
27
Show Answer
Questions on B and B+ Trees : Question 8 :
Consider the following 2-3-4 tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. GATECS2003Q65 What is the result of inserting G in the above tree ?
A) GATECS2003Q65A

B) GATECS2003Q65B

C) GATECS2003Q65C

D) None of the above

A
B
C
D
Show Answer
Questions on B and B+ Trees : Question 9 :
A B+ -tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk block are size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ -tree?

16
42
43
44
Show Answer
Questions on B and B+ Trees : Question 10 :
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 ________ Q12

4
5
6
7
Show Answer