DSQUIZ 2020-21

Which type of traversal of binary search tree outputs the value in sorted order?

• a) Pre-order

• b) In-order

• c) Post-order

• d) None

A binary search tree is generated by inserting in order the following integers:

50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24

The number of the node in the left sub-tree and right sub-tree of the root, respectively, is

• a) (4, 7)

• b) (7, 4)

• c) (8, 3)

• d) (3, 8)

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

• a) Queue

• b) Stack

• c) Tree

• d) Linked list

The data structure required for Breadth First Traversal on a graph is?

• a) Stack

• b) Array

• c) Queue

• d) Tree

The data structure required for Depth First Traversal on a graph is?

• a) Stack

• b) Array

• c) Queue

• d) Tree

Let the following circular queue can accommodate maximum six elements with the following data

front = 2 rear = 4

queue = -, L, M, N, -,-

What will happen after ADD O operation takes place?

• a) front = 2 rear = 5

  queue = ______; L, M, N, O, ___

• b) front = 3 rear = 5

  queue = L, M, N, O, ___

• c) front = 3 rear = 4

  queue = ______; L, M, N, O, ___

• d) front = 2 rear = 4

  queue = L, M, N, O, ___

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC

If the elements “A”, “B”, “C” and “D” are placed in a Stack and are deleted one at a time, in what order will they be removed?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABCD

If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated while inserting an element in the queue?

• a) rear=(rear%1)+MAX_SIZE

• b) rear=rear%(MAX_SIZE+1)

• c) rear=(rear+1)%MAX_SIZE

• d) rear=rear+(1%MAX_SIZE)

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

• a) 0

• b) 7

• c) 9

• d) 10