### Queue MCQ - Multiple Choice Questions and Answers

Welcome to the Queue data structure quiz. This Queue data structure quiz consists of 10+ multiple-choice questions (MCQ) with answers and explanations.

To help you check your understanding, we've curated a 10+ multiple-choice questions quiz on Queue data structure. Remember, the goal here is to learn, so try answering each question before checking the answers and explanations.

# 1. Which principle is followed by the Queue data structure?

A) LIFO
B) FIFO
C) LILO
D) FILO

B) FIFO

## Explanation:

FIFO stands for First In First Out, which is the principle followed by the Queue data structure. The first element that is added to the queue will be the first one to be removed.

# 2. Which of the following is not a real-life example of a Queue?

A) Waiting in line to order food at a restaurant
B) Waiting in line to buy movie tickets
C) Managing tasks on a CPU
D) Using a stack of dishes

D) Using a stack of dishes

## Explanation:

Using a stack of dishes is not a real-life example of a Queue but of Stack where the last dish added is the first one to be removed (LIFO).

# 3. Which operation is used to add an element in the Queue?

A) Push
B) Pop
C) Enqueue
D) Dequeue

C) Enqueue

## Explanation:

In a Queue, the operation of adding an element is called "Enqueue".

# 4. What is the operation to remove an element from the Queue?

A) Push
B) Pop
C) Enqueue
D) Dequeue

D) Dequeue

## Explanation:

In a Queue, the operation of removing an element is called "Dequeue".

# 5. What does 'underflow' mean in a Queue?

A) Queue is full
B) Queue is empty
C) There is an error in the queue
D) Queue has only one element

B) Queue is empty

## Explanation:

'Underflow' is a situation where an attempt is made to remove an element from an empty Queue

# 6. What is the time complexity of enqueue operation in a queue?

A) O(n)
B) O(n log n)
C) O(1)
D) O(n²)

C) O(1)

## Explanation:

The enqueue operation in a Queue has a time complexity of O(1) i.e., constant time.

# 7. Is a Queue a dynamic data structure?

A) Yes
B) No

A) Yes

## Explanation:

Yes, a Queue is a dynamic data structure because its size can change during the program run.

# 8. What is the front of a Queue?

C) The middle element
D) None of the above

## Explanation:

The 'front' of a Queue refers to the first element that was added.

# 9. Which is a type of Queue?

A) Priority Queue
B) LIFO Queue
C) FILO Queue
D) None of the above

A) Priority Queue

## Explanation:

A priority queue is a type of queue where each element has a priority. Elements with higher priority are dequeued before elements with lower priority.

# 10. What is the time complexity to get the front element from the queue?

A) O(1)
B) O(n)
C) O(n log n)
D) O(n²)

A) O(1)

## Explanation:

Accessing the front element from the Queue is a constant time operation, O(1).

# 11. What is a circular queue?

A) A queue where the last element points to the first
B) A queue where the first element points to the last
C) A queue that can only hold circular objects
D) None of the above

A) A queue where the last element points to the first

## Explanation:

A circular queue is a linear data structure in which the operations are performed based on the FIFO principle and the last position is connected back to the first position to make a circle.

Keep these concepts in mind as you continue to work with Queue data structure. We hope this quiz proves useful in enhancing your understanding. Stay tuned for more quizzes on different aspects of computer science. Happy learning and happy coding!