MCQ of Queue
1. What is the principle of a queue data structure?
A. LIFO – Last In First Out
B. FIFO – First In First Out
C. FILO – First In Last Out
D. LILO – Last In Last Out
Correct Answer: B
2. Which of the following operations is not performed on a queue?
A. Insert at rear
B. Delete from front
C. Peek front element
D. Insert at front
Correct Answer: D
3. Which data structure is used in breadth-first search (BFS)
algorithm?
A. Stack
B. Queue
C. Tree
D. Graph
Correct Answer: B
4. What happens when we dequeue from an empty queue?
A. Underflow
B. Overflow
C. Segmentation Fault
D. No effect
1. What is the principle of a queue data structure?
A. LIFO – Last In First Out
B. FIFO – First In First Out
C. FILO – First In Last Out
D. LILO – Last In Last Out
Correct Answer: B
2. Which of the following operations is not performed on a queue?
A. Insert at rear
B. Delete from front
C. Peek front element
D. Insert at front
Correct Answer: D
3. Which data structure is used in breadth-first search (BFS)
algorithm?
A. Stack
B. Queue
C. Tree
D. Graph
Correct Answer: B
4. What happens when we dequeue from an empty queue?
A. Underflow
B. Overflow
C. Segmentation Fault
D. No effect
