Question

Which of the following is a characteristic of the ``Queue" data structure?

• A. Follows a Last-In-First-Out (LIFO) order
• B. Allows insertion at both ends
• C. Follows a First-In-First-Out (FIFO) order
• D. Does not allow deletion of elements

Hint:

To understand Queue:
- Remember FIFO: First In, First Out.
- Compare with Stack (LIFO) and Deque (both ends).
- Practice with enqueue/dequeue operations.

Answer 1

The Correct Option is C

To determine the correct characteristic of the Queue data structure, we need to understand its defining properties.
Step 1: Understand the Queue Data Structure
A Queue is a linear data structure that follows the First-In-First-Out (FIFO) principle, meaning the first element added is the first to be removed.
Elements are typically inserted at the rear (enqueue) and removed from the front (dequeue).
Step 2: Analyze Option A - Follows a Last-In-First-Out (LIFO) order
LIFO is characteristic of a Stack, not a Queue, where the last element added is removed first.
Thus, option A is incorrect.
Step 3: Analyze Option B - Allows insertion at both ends
This describes a Deque (double-ended queue), not a standard Queue, which allows insertion only at the rear.
Thus, option B is incorrect.
Step 4: Analyze Option C - Follows a First-In-First-Out (FIFO) order
FIFO is the defining feature of a Queue, where elements are processed in the order they are added (e.g., like a line of people).
This aligns with the Queue's behavior.
Thus, option C is correct.
Step 5: Analyze Option D - Does not allow deletion of elements
Queues allow deletion (dequeue) from the front, making this statement false.
Thus, option D is incorrect.
Step 6: Conclusion
The primary characteristic of a Queue is its FIFO order, making option C the correct answer.