MCQs on Queue with answers

02-19-2015 05:27 AM

MCQs on Queue with answers

1. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at
end (rear) is known as a ?
a) Queue
b) Stack
c) Tree
d) Linked list
View Answer / Hide Answer

ANSWER: a) Queue

2. The data structure required for Breadth First Traversal on a graph is?
a) Stack
b) Array
c) Queue
d) Tree
View Answer / Hide Answer

ANSWER: c) Queue

3. 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, ___

View Answer / Hide Answer

ANSWER: a)

4. A queue is a ?
a) FIFO (First In First Out) list
b) LIFO (Last In First Out) list.
c) Ordered array
d) Linear tree
View Answer / Hide Answer

ANSWER: a) FIFO (First In First Out) list

5. In Breadth First Search of Graph, which of the following data structure is used?
a) Stack
b) Queue
c) Linked list
d) None
View Answer / Hide Answer

ANSWER: b) Queue

6. 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
removed?
a) ABCD
b) DCBA
c) DCAB
d) ABCD
View Answer / Hide Answer

ANSWER: a) ABCD

7. In linked list implementation of a queue, where does a new element be inserted?

ANSWER: b) At the tail of the link list

8. In the array implementation of circular queue, which of the following operation take worst case linear time?
a) Insertion
b) Deletion
c) To empty a queue
d) None
View Answer / Hide Answer

ANSWER: d) None

9. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take
linear time?
a) Insertion
b) Deletion
c) To empty a queue
d) Both a) and c)
View Answer / Hide Answer

ANSWER: d) Both a) and c)

10. If the MAX_SIZE is the size of the array used in the implementation of circular queue. How is rear manipulated
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)
View Answer / Hide Answer

ANSWER: c) rear=(rear+1)%MAX_SIZE

11. If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, f
to the first element in the queue, and rear point to the last element in the queue. Which of the following condition
circular queue is FULL?
a) Front=rear= -1
b) Front=(rear+1)%MAX_SIZE
c) Rear=front+1
d) Rear=(front+1)%MAX_SIZE
View Answer / Hide Answer

ANSWER: b) Front=(rear+1)%MAX_SIZE

12. A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9
insertion of next element takes place at the array index.
a) 0
b) 7
c) 9
d) 10
View Answer / Hide Answer

ANSWER: a) 0

13. If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, f
to the first element in the queue, and rear point to the last element in the queue. Which of the following condition
circular queue is EMPTY?
a) Front=rear=0
b) Front= rear=-1
c) Front=rear+1

d) Front=(rear+1)%MAX_SIZE
View Answer / Hide Answer

ANSWER: b) Front= rear=-1

14. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
a) Queue
b) Circular queue
c) Dequeue
d) Priority queue
View Answer / Hide Answer

ANSWER: c) Dequeue

15. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will chang
insertion into a NONEMPTY queue?
a) Only front pointer
b) Only rear pointer
c) Both front and rear pointer
d) None of the front and rear pointer
View Answer / Hide Answer

ANSWER: b) Only rear pointer

16. A normal queue, if implemented using an array of size MAX_SIZE, gets full when
a) Rear=MAX_SIZE-1
b) Front=(rear+1)mod MAX_SIZE
c) Front=rear+1
d) Rear=front
View Answer / Hide Answer

ANSWER: a) Rear=MAX_SIZE-1

17. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will chang
insertion into EMPTY queue?
a) Only front pointer
b) Only rear pointer
c) Both front and rear pointer
d) None
View Answer / Hide Answer

ANSWER: c) Both front and rear pointer

18. An array of size MAX_SIZE is used to implement a circular queue. Front, Rear, and count are tracked. Suppose
and rear is MAX_SIZE -1. How many elements are present in the queue?
a) Zero
b) One
c) MAX_SIZE-1
d) MAX_SIZE
View Answer / Hide Answer

ANSWER: d) MAX_SIZE

19. Suppose a circular queue of capacity (n-1) elements is implemented with an array of n elements. Assume that
insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. In
REAR=FRONT=0. The conditions to detect queue full and queue is empty are?
a) Full: (REAR+1)mod n == FRONT
Empty: REAR==FRONT
b) Full: (REAR+1)mod n == FRONT
Empty: (FRONT+1) mod n == REAR
c) Full: REAR==FRONT
Empty: (REAR+1) mod n==FRONT
d) Full: (FRONT+1)mod n==REAR
Empty: REAR==FRONT
View Answer / Hide Answer

ANSWER: a)

20. Consider the following operations along with ENQUEUE and DEQUEUE operations queues, where k is a globa
Multiqueue(Q)
{
m=k;
while(Q is not empty) and (m > 0)
{
DEQUEUE(Q)
m=m-1
}
}
What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?
a) (n)
b) (n + k)
c) (nk)
d) (n2)
View Answer / Hide Answer

ANSWER: a) (n)