DSA AI- B

Let the following circular queue can accommodate maximum six elements with the following
data:
front = 2 rear = 4
queue = _______; L, M, N, ___, ___

• 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

Consider a circular queue that can hold a maximum of five elements with the following
data:
front = 1 rear = 3
queue = _______; A, B, C, ___, ___

• a) front = 1 rear = 4

  queue = ______; A, B, C, D

• b) front = 2 rear = 4

  ___ queue = A, B, C, D

• c) front = 2 rear = 3

  queue = ______; A, B, C, D

• d) front = 1 rear = 3

  ___ queue = A, B, C, D

Given a circular queue with a maximum capacity of seven elements, the current state is:
front = 0 rear = 5
queue = _______; P, Q, R, S, T, ___, ___

• a) front = 0 rear = 6

  queue = ______; P, Q, R, S, T, U

• b) front = 1 rear = 6

  ___ queue = P, Q, R, S, T, U

• c) front = 1 rear = 5

  queue = ______; P, Q, R, S, T, U

• d) front = 0 rear = 5

  ___ queue = P, Q, R, S, T, U

In a circular queue that can accommodate a maximum of eight elements, the following
data is provided:
front = 3 rear = 7
queue = _______; X, Y, Z, ___, ___, ___, ___, ___

• a) front = 3 rear = 0

  queue = ______; X, Y, Z, A, B, C, D, E

• b) front = 4 rear = 0

  ___ queue = X, Y, Z, A, B, C, D, E

• c) front = 4 rear = 7

  queue = ______; X, Y, Z, A, B, C, D, E

• d) front = 3 rear = 7

  ___ queue = X, Y, Z, A, B, C, D, E

How many stacks are needed to implement a queue. Consider the situation where no other
data structure like arrays, linked list is available to you

• 1

• 2

• 3

• 4

In a circular queue with a maximum capacity of ten elements, the current state is:
front = 4 rear = 8
queue = _______; A, B, C, D, E, F, G, H, I, ___

• a) front = 4 rear = 9

  queue = ______; A, B, C, D, E, F, G, H, I, J

• b) front = 5 rear = 9

  ___ queue = A, B, C, D, E, F, G, H, I, J

• c) front = 5 rear = 8

  queue = ______; A, B, C, D, E, F, G, H, I, J

• d) front = 4 rear = 8

  ___ queue = A, B, C, D, E, F, G, H, I, J

Given a circular queue that can hold a maximum of four elements, the following
data is provided:
front = 1 rear = 2
queue = _______; J, K, ___, ___

• a) front = 1 rear = 3

  queue = ______; J, K, L

• b) front = 2 rear = 3

  ___ queue = J, K, L

• c) front = 2 rear = 2

  queue = ______; J, K, L

• d) front = 1 rear = 2

  ___ queue = J, K, L

How many queues are needed to implement a stack? Consider the situation where no other
data structure like arrays, linked list is available to you

• 1

• 2

• 3

• 4

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.

• 0

• 7

• 9

• 10

The operation for removing an entry from a stack is traditionally called:

• (a) delete
  
  

• (b) peek

• (c) pop

• (d) remove