# 100+ Queue Operations Data Structure MCQs and Answers

The queue operations MCQs and answers guide is a comprehensive course for preparing for your quiz or examination on the topic of queue data structure. It aims at providing a methodical idea about questions similar to their real exam conditions. The content of this course not only teaches you core concepts but also helps you in learning few tricks and tips that will be quite important when you want to solve Maximum Weighted Matching problem. These Queue Operations Data Structure MCQs and Answers will help you prepare for any exam including GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Queue Operations Data Structure MCQs and Answers

a) Queue

b) Stack

c) Tree

a) Stack

b) Array

c) Queue

d) Tree

##### 3. Let the following circular queue can accommodate maximum six elements with the following datafront = 2 rear = 4queue = _______; 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, ___

Answer: front = 2 rear = 5
queue = ______; L, M, N, O, ___

##### 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

Answer: FIFO (First In First Out) list

a) Stack

b) Queue

d) None

a) ABCD

b) DCBA

c) DCAB

d) ABCD

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

b) At the tail of the link list

c) At the centre position in the link list

d) None

##### 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

##### 9. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

a) Insertion

b) Deletion

c) To empty a queue

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 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)

##### 11. If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first element in the queue, and rear point to the last element in the queue. Which of the following condition specify that circular queue is FULL?

a) Front=rear= -1

b) Front=(rear+1)%MAX_SIZE

c) Rear=front+1

d) Rear=(front+1)%MAX_SIZE

a) 0

b) 7

c) 9

d) 10

##### 13. If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first element in the queue, and rear point to the last element in the queue. Which of the following condition specify that circular queue is EMPTY?

a) Front=rear=0

b) Front= rear=-1

c) Front=rear+1

d) Front=(rear+1)%MAX_SIZE

##### 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

##### 15. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an 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