The function of “ Buffer” is performed as,
-
Stack
-
Array
-
Queue
-
Linked List
A buffer operates as a Queue (FIFO - First In First Out) data structure. Items are added to the end and removed from the front, which matches the fundamental behavior of buffers in computer systems.
A buffer is a temporary storage area used to hold data while it's being transferred between two devices or between a producer and consumer operating at different speeds (e.g. between a program and an I/O device). It's read and written in the same order it arrives -- first in, first out -- which is exactly how a Queue behaves. A Stack (LIFO) or Linked List/Array (which don't inherently enforce ordering of access) don't match the buffering behavior, so Queue is the correct characterization.