What operation adds an item to the rear of a queue?

What operation adds an item to the rear of a queue?

• A. Dequeue
• B. Enqueue
• C. Push
• D. Pop

Answer: (B)

In a queue, items are processed in First-In-First-Out order, meaning new elements go to the back and wait their turn. The operation that adds an element to the rear of the queue is enqueue. Dequeue removes from the front, which is the opposite action. Push and Pop are terms associated with stacks, where elements are added or removed from the top. So enqueue is the correct operation for adding to the rear of a queue.

In a queue, items are processed in First-In-First-Out order, meaning new elements go to the back and wait their turn. The operation that adds an element to the rear of the queue is enqueue. Dequeue removes from the front, which is the opposite action. Push and Pop are terms associated with stacks, where elements are added or removed from the top. So enqueue is the correct operation for adding to the rear of a queue.