Test: B - Tree

# Test: B - Tree

Test Description

## 10 Questions MCQ Test Database Management System (DBMS) | Test: B - Tree

Test: B - Tree for Computer Science Engineering (CSE) 2022 is part of Database Management System (DBMS) preparation. The Test: B - Tree questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: B - Tree MCQs are made for Computer Science Engineering (CSE) 2022 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: B - Tree below.
Solutions of Test: B - Tree questions in English are available as part of our Database Management System (DBMS) for Computer Science Engineering (CSE) & Test: B - Tree solutions in Hindi for Database Management System (DBMS) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: B - Tree | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Database Management System (DBMS) for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: B - Tree - Question 1

### Which of the following is true?

Detailed Solution for Test: B - Tree - Question 1

The average probability of the split is 1/([m / 2] – 1), where m is the order of B-tree. So, if m larger, the probability of split will be less.

Test: B - Tree - Question 2

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

Detailed Solution for Test: B - Tree - Question 2

B-tree of order n and with height k has best case height h, where h = logn (k+1) – 1. The best case occurs when all the nodes are completely filled with keys.

Test: B - Tree - Question 3

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

Detailed Solution for Test: B - Tree - Question 3

2-3-4 trees are isometric of Red-Black trees. It means that, for every 2-3-4 tree, there exists a Red-Black tree with data elements in the same order.

Test: B - Tree - Question 4

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

Detailed Solution for Test: B - Tree - Question 4

If s splits occur in a B-tree, 2s + 1 nodes are written (2 halves of each split and the parent of the last node split). So, if 5 splits occurred, then 2 * 5 + 1, i.e. 11 nodes are written.

Test: B - Tree - Question 5

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

Detailed Solution for Test: B - Tree - Question 5

A B-tree of order m of height h will have the maximum number of keys when all nodes are completely filled. So, the B-tree will have n = (mh+1 – 1) keys in this situation. So, required number of maximum keys = 43+1 – 1 = 256 – 1 = 255.

Test: B - Tree - Question 6

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

Detailed Solution for Test: B - Tree - Question 6

In external memory, the data is transferred in form of blocks. These blocks have data valued and pointers. And B-tree can hold both the data values and pointers. So B-tree is used as an external memory data structure.

Test: B - Tree - Question 7

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

Detailed Solution for Test: B - Tree - Question 7

A non-root node in a B-tree of order n contains at least (n – 1)/2 keys. And contains a maximum of (n – 1) keys and n sons.

Test: B - Tree - Question 8

A B-Tree used as an index for a large database table has 7 levels where level of the root node is 0. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:

Detailed Solution for Test: B - Tree - Question 8

At every level, one new node is created except root, at two new nodes is created.
Tips and Tricks:
If database table has h levels and level of root node is 0 then on a new key insertion, maximum number of nodes newly created is h + 2
New nodes = 7 + 2 = 9
If database table has h levels and level of root node is 1 then on a new key insertion, maximum number of nodes newly created is h + 1

Test: B - Tree - Question 9

If a node has K children in B tree, then the node contains exactly _______ keys.

Detailed Solution for Test: B - Tree - Question 9

CONCEPT:
B-tree is a self-balancing search tree that allows all operations i.e. searching, insertion, deletion in logarithmic(log) time.
Key Points
A B-tree of order m must satisfy the following properties:

• Every node can have maximum m children.
• Every internal node (except root) can have at least [m/2] child nodes.
• The root, if not a leaf node, can have at least two children.
• An internal node with k children contains k − 1 key.
• All leaf nodes must be at the same level.

Hence, if a node has K children in B tree, then the node contains exactly k-1 keys.

Test: B - Tree - Question 10

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

Detailed Solution for Test: B - Tree - Question 10

Concept:
Considering all nodes are completely full means every node has N − 1 key.
If a new key is inserted, then at every level there will be a new node created, and in the worst-case root node will also be broken into two parts. Since we have 4 levels, then 5 new nodes will be created
Diagram needs to be updated

First, the overflow happens at the leaf, and second on the parent of that leaf, and so on until the last overflow happens at the root node.

Key Points
If the database table has h levels and the level of the root node is 1 then on a new key insertion, the maximum number of nodes newly created is h + 1

## Database Management System (DBMS)

1 videos|51 docs|31 tests
 Use Code STAYHOME200 and get INR 200 additional OFF Use Coupon Code
Information about Test: B - Tree Page
In this test you can find the Exam questions for Test: B - Tree solved & explained in the simplest way possible. Besides giving Questions and answers for Test: B - Tree , EduRev gives you an ample number of Online tests for practice

## Database Management System (DBMS)

1 videos|51 docs|31 tests