Top B-Tree MCQs with FREE PDF

We have the best collection of B-Tree MCQs and answer with FREE PDF. These B-Tree MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

B-Tree MCQs

1. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

a) 14

b) 7

c) 11

d) 5

Answer: 11

2. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

a) 255

b) 63

c) 127

d) 188

Answer: 255

3. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

a) True

b) False

Answer: True

4. 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.

a) AVL

b) AA

c) 2-3

d) Red-Black

Answer: Red-Black

5. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

a) at most (n – 1)/2 keys

b) exact (n – 1)/2 keys

c) at least 2n keys

d) at least (n – 1)/2 keys

Answer: at least (n – 1)/2 keys

6. What is the best case height of a B-tree of order n and which has k keys?

a) logn (k+1) – 1

b) nk

c) logk (n+1) – 1

d) klogn

Answer: logn (k+1) – 1

7. Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.

a) True

b) False

Answer: True

8. Which of the following is the most widely used external memory data structure?

a) AVL tree

b) B-tree

c) Red-black tree

d) Both AVL tree and Red-black tree

Answer: B-tree

9. Which of the following is true?

a) larger the order of B-tree, less frequently the split occurs

b) larger the order of B-tree, more frequently the split occurs

c) smaller the order of B-tree, more frequently the split occurs

d) smaller the order of B-tree, less frequently the split occurs

Answer: larger the order of B-tree, less frequently the split occurs

B-Tree MCQs PDF Download

Top B+ Tree MCQs with FREE PDF

Top 2-3 Tree MCQs with FREE PDF

Comments