Home »
MCQs »
DBMS MCQs
DBMS B+ File Organization MCQs
DBMS B+ File Organization MCQs: This section contains multiple-choice questions and answers on B+ File Organization in DBMS.
Submitted by Anushree Goswami, on April 22, 2022
1. It is an indexed sequential access method that uses the ___ tree file organization method.
- B
- B+
- B++
- B+++
Answer: B) B+
Explanation:
It is an indexed sequential access method that uses the B+ tree file organization method.
Discuss this Question
2. Records are stored in Files using a ___-like structure.
- Triangle
- Roots
- Stems
- Tree
Answer: D) Tree
Explanation:
Records are stored in Files using a tree-like structure.
Discuss this Question
3. The records are sorted based on the ___ key, just like the key-index concept.
- Primary
- Foreign
- Composite
- Alternate
Answer: A) Primary
Explanation:
The records are sorted based on the primary key, just like the key-index concept.
Discuss this Question
4. An ___ value is generated and mapped to each primary key.
- Iterative
- Imposter
- Index
- Indicate
Answer: C) Index
Explanation:
An index value is generated and mapped to each primary key.
Discuss this Question
5. In some ways, B+ trees are similar to ___ (BSTs), but they can have more than two children.
- Binary Stem Trees
- Binary Stretch Trees
- Binary Search Trees
- Binary Solve Trees
Answer: C) Binary Search Trees
Explanation:
In some ways, B+ trees are similar to binary search trees (BSTs), but they can have more than two children.
Discuss this Question
6. Records are all stored in the ___ node of the B+ Tree method.
- Stem
- Root
- Leaf
- None
Answer: C) Leaf
Explanation:
Records are all stored in the leaf node of the B+ Tree method.
Discuss this Question
7. Leaf nodes are pointed to by ___ nodes.
- Beginner
- Last
- Intermediate
- None
Answer: C) Intermediate
Explanation:
Leaf nodes are pointed to by intermediate nodes.
Discuss this Question
8. Intermediate note does not contain any ___.
- Column
- Data
- Record
- File
Answer: C) Record
Explanation:
Leaf nodes are pointed to by intermediate nodes.
Discuss this Question
9. The ___ method allows for easy searching since each record is stored in a leaf node and ordered sequentially.
- B+ Tree
- Has
- Heap
- ISMA
Answer: A) B+ Tree
Explanation:
The B+ Tree method allows for easy searching since each record is stored in a leaf node and ordered sequentially.
Discuss this Question
10. It is ___ to navigate through the tree structure.
- Easier
- Faster
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
It is easier and faster to navigate through the tree structure.
Discuss this Question
11. B+ trees are not limited in ___, so the number of records can grow or shrink, and the structure of the B+ tree can also change.
- Length
- Size
- Rows
- Columns
Answer: B) Size
Explanation:
B+ trees are not limited in size, so the number of records can grow or shrink, and the structure of the B+ tree can also change.
Discuss this Question
12. There is no performance impact from ___ items in a B+ Tree.
- Inserting
- Updating
- Deleting
- All of the above
Answer: D) All of the above
Explanation:
There is no performance impact from inserting, updating, or deleting items in a B+ Tree.
Discuss this Question
13. The ___ method of B+ Trees is inefficient.
- Static
- Dynamic
- Both A and B
- None of the above
Answer: A) Static
Explanation:
The static method of B+ Trees is inefficient.
Discuss this Question