Menu

Question Discussion & Solution

MCQ

Q.

The smallest number of key that will force a B-tree of order 3 to have a height 3 is

A

5

B

7

C

12

D

16

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

B Trees are generally

A

very deep and narrow

B

very wide and shallow

C

very deep and very wide

D

cannot say

Discussion

MCQ

2.

The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is

A

2

B

3

C

4

D

5

Discussion

MCQ

3.

A B-tree of minimum degree t can maximum _____ pointers in a node.

A

t

B

2t

C

2t

D

t

Discussion

MCQ

4.

The smallest number of key that will force a B-tree of order 3 to have a height 3 is

A

5

B

7

C

12

D

16

Discussion

MCQ

5.

In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.

A

Threaded binary trees

B

AVL Tree

C

B+ tree

D

Heap

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs