In a queue, which term describes the processing order?

In a queue, which term describes the processing order?

• A. Last In, Last Out
• B. First In, First Out
• C. Last In, First Out
• D. First Out, Last In

Answer: (B)

In a queue, items are processed in the order they arrive—the one that comes in first is the one that goes out first. This is described as First In, First Out. In practical terms, you add new items to the rear (enqueue) and remove from the front (dequeue), so the earliest entry exits before later ones. This contrasts with structures like a stack, which uses Last In, First Out: the most recently added item is removed first. An intuitive example is people waiting in line for service—the person at the front is served first, then the next, and so on.

In a queue, items are processed in the order they arrive—the one that comes in first is the one that goes out first. This is described as First In, First Out. In practical terms, you add new items to the rear (enqueue) and remove from the front (dequeue), so the earliest entry exits before later ones. This contrasts with structures like a stack, which uses Last In, First Out: the most recently added item is removed first. An intuitive example is people waiting in line for service—the person at the front is served first, then the next, and so on.