In computer science, which data structure implements FIFO behavior?

In computer science, which data structure implements FIFO behavior?

• A. Stack
• B. Array
• C. Queue
• D. Linked List

Answer: (C)

FIFO means first in, first out. A queue is built around this idea: items are added at the back and removed from the front, so the earliest item entered is the first one out. A stack is the opposite, using last in, first out; an array is just a memory structure that can store items but doesn’t inherently enforce order; a linked list is a flexible collection that can be used to implement a queue but doesn’t by itself enforce FIFO. Therefore, the data structure that implements FIFO behavior is the queue.

FIFO means first in, first out. A queue is built around this idea: items are added at the back and removed from the front, so the earliest item entered is the first one out. A stack is the opposite, using last in, first out; an array is just a memory structure that can store items but doesn’t inherently enforce order; a linked list is a flexible collection that can be used to implement a queue but doesn’t by itself enforce FIFO. Therefore, the data structure that implements FIFO behavior is the queue.