wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Data Structure

Total questions: 13

Worksheet time: 7mins

Name
Class
Date
1.

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

a)

a) AVL tree

b)

b) B-tree

c)

c) Red-black tree

d)

d) Both AVL tree and Red-black tree

2.

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

a)

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

b)

b) exact (n – 1)/2 keys

c)

c) at least 2n keys

d)

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

3.

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

a)

a) 255

b)

b) 63

c)

c) 127

d)

d) 188

4.

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

a)

a) 14

b)

b) 7

c)

c) 11

d)

d) 5

5.

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

a)

a) True

b)

b) False

6.

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

a)

a) AVL

b)

b) AA

c)

c) 2-3

d)

d) Red-Black

7.

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

a)

a) logn (k+1) – 1

b)

b) nk

c)

c) logk (n+1) – 1

d)

d) klogn

8.

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

a)

True

b)

False

9.

Which of the following is true?

a)

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

b)

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

c)

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

d)

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

10.

2-3 tree is a specific form of _________

a)

1. B – tree

b)

2. B+ – tree

c)

3. AVL tree

d)

4. Heap

11.

Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.

Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

a)

1. Statement 1 is true but statement 2 is false

b)

2. Statement 2 is true but statement 1 is false

c)

3. Both the statements are true

d)

4. Both the statements are false

12.

What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?

a)

1. 3

b)

2. 80

c)

3. 27

d)

4. 26

13.

In a B+ tree, both the internal nodes and the leaves have keys.

a)

1. True

b)

2. False