What design pattern is used to implement a data structure that operates on a FIFO principle?

To implement a FIFO (First In, First Out) data structure, the common design pattern used is the Queue.

In Android and Java, this can be implemented using the Queue interface and its implementations, such as LinkedList or ArrayDeque.

Example of using a queue:

Queue<String> queue = new LinkedList<>();
queue.add("First");
queue.add("Second");

String first = queue.poll(); // returns "First"
String second = queue.poll(); // returns "Second"

Thus, the "Queue" pattern ensures elements are processed in FIFO order.