×

Multiple-Choice Questions

Web Technologies MCQs

Computer Science Subjects MCQs

Databases MCQs

Programming MCQs

Testing Software MCQs

Digital Marketing Subjects MCQs

Cloud Computing Softwares MCQs

AI/ML Subjects MCQs

Engineering Subjects MCQs

Office Related Programs MCQs

Management MCQs

More

DBMS B+ Tree MCQs

DBMS B+ Tree MCQs: This section contains multiple-choice questions and answers on B+ Tree in DBMS.
Submitted by Anushree Goswami, on April 23, 2022

1. A ___ binary search tree is a B+ tree.

  1. Balanced
  2. Unbalanced
  3. Positive
  4. B Positive

Answer: A) Balanced

Explanation:

A balanced binary search tree is a B+ tree.

Discuss this Question


2. There is/are ___ levels of indexing in the B+ tree.

  1. Single
  2. Double
  3. Triple
  4. Multiple

Answer: D) Multiple

Explanation:

There are multiple levels of indexing in the B+ tree.

Discuss this Question


3. The leaf nodes of the B+ tree represent actual data ___.

  1. Sets
  2. Bases
  3. Points
  4. Types

Answer: C) Points

Explanation:

The leaf nodes of the B+ tree represent actual data points.

Discuss this Question


4. A B+ tree maintains the same height of all leaf nodes.

  1. Same
  2. Similar
  3. Different
  4. Far

Answer: A) Same

Explanation:

A B+ tree maintains the same height of all leaf nodes.

Discuss this Question


5. A ___ is used to link the leaf nodes in the B+ tree.

  1. Stack
  2. Queue
  3. Link List
  4. None

Answer: C) Link List

Explanation:

A link list is used to link the leaf nodes in the B+ tree.

Discuss this Question


6. B+ trees can support ___ access.

  1. Sequential
  2. Random
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

B+ trees can support both sequential and random access.

Discuss this Question


7. There is an equal distance between every leaf node and its counterpart at the ___ node in the B+ tree.

  1. Leaf
  2. Root
  3. Stem
  4. None

Answer: B) Root

Explanation:

There is an equal distance between every leaf node and its counterpart at the root node in the B+ tree.

Discuss this Question


8. The B+ tree has a ___ number of branches of the order n.

  1. Fixed
  2. Different
  3. Separate
  4. Consecutive

Answer: A) Fixed

Explanation:

The B+ tree has a fixed number of branches of the order n.

Discuss this Question


9. A ___ are included in the B+ tree.

  1. Leaf Node
  2. Internal Node
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

A leaf node and an internal node are included in the B+ tree.

Discuss this Question


10. The root node of the B+ tree contains the most ___ (n/2).

  1. Record Points
  2. Record Pointers
  3. Record Sets
  4. Record Files

Answer: B) Record Pointers

Explanation:

The root node of the B+ tree contains the most record pointers (n/2).

Discuss this Question


11. n is the ___ number of pointers an internal node contains.

  1. Minimum
  2. Maximum
  3. Average
  4. None

Answer: B) Maximum

Explanation:

n is the maximum number of pointers an internal node contains.

Discuss this Question


12. At least n/2 record pointers and n/2 key values can be contained in a/an/the ___ node(s) of the B+ tree.

  1. Leaf
  2. Internal
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

At least n/2 record pointers and n/2 key values can be contained in a leaf node of the B+ tree.

Discuss this Question


13. Leaf nodes contain the maximum number of ___ n.

  1. Record Pointers
  2. Key Values
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

Leaf nodes contain the maximum number of record pointers and key values n.

Discuss this Question


14. P points to the next leaf node in the ___ in every leaf node of the ___.

  1. Tree
  2. B+ Tree
  3. B Tree
  4. B++ Tree

Answer: B) B+ Tree

Explanation:

P points to the next leaf node in the B+ tree in every leaf node of the B+ tree.

Discuss this Question





Comments and Discussions!

Load comments ↻





Copyright © 2024 www.includehelp.com. All rights reserved.