How does a queue operate in computer programming?

A queue operates on a First-In-First-Out (FIFO) principle, meaning that the first element added to the queue will be the first one to be removed. This is accurately described by the option stating that elements are added to the back and removed from the front.

In this structure, when an element is enqueued (added) to the queue, it goes to the back, and when an element is dequeued (removed), it comes from the front. This behavior mimics real-life scenarios, such as waiting in line where the first person to enter the line is the first one served. Understanding this operation is crucial for managing data flows in various applications, such as task scheduling and handling requests in systems.

The other options do not accurately reflect the operations typical of a queue. For instance, removing elements from the back or allowing random access contradicts the core FIFO characteristic of queues.