# What Is Queue Example in Data Structure?

//

Angela Bailey

A queue is a fundamental data structure in computer science that follows the principle of “first-in, first-out” (FIFO). It is an ordered collection of elements where the addition of new elements, called enqueue, takes place at one end and the removal of existing elements, called dequeue, occurs at the other end.

Queues can be visualized as a line of people waiting for their turn. The person who arrives first gets served first, while others have to wait in line. This behavior makes queues useful for solving various real-world problems, such as handling requests in a web server or managing tasks in an operating system.

## Queue Example: Bank Teller Simulation

Let’s consider a practical example to better understand how queues work. Suppose you are simulating a bank teller system where customers arrive and join the queue to perform their transactions.

To represent this scenario using a queue data structure, we can use an array or a linked list. Each element in the queue represents a customer. The enqueue operation adds new customers to the back of the queue, and the dequeue operation removes customers from the front.

### Queue Operations:

• Enqueue: Adds an element to the back of the queue.
• Dequeue: Removes and returns the element at the front of the queue.
• Front: Returns (without removing) the element at the front of the queue.
• Rear: Returns (without removing) the element at the back of the queue.
• IsEmpty: Checks if the queue is empty or not.

### Bank Teller Simulation Example:

Let’s consider the following sequence of events in our bank teller simulation:

1. Alice arrives and joins the queue.
2. Bob arrives and joins the queue.
3. Charlie arrives and joins the queue.
4. The bank teller serves Alice and dequeues her from the front of the queue.
5. Daniel arrives and joins the queue.
6. The bank teller serves Bob and dequeues him from the front of the queue.

In this example, Alice is the first customer to arrive, so she is served first. Bob has to wait until Alice’s transaction is complete.

Charlie joins the queue after Bob, so he will be served after Bob. Daniel arrives even later and waits at the end of the line.

This sequence of events demonstrates how a queue maintains order when processing elements based on their arrival time. The bank teller always serves customers in the order they joined the queue, allowing for fair treatment of everyone waiting in line.

## Conclusion

A queue is an essential data structure that follows FIFO behavior, making it useful for handling various real-world scenarios. Whether it’s simulating a bank teller system or managing tasks in an operating system, queues provide an organized way to process elements based on their arrival order.

By understanding how queues work and mastering their operations, you can effectively solve problems that require processing elements in a specific order. So next time you encounter a situation where maintaining order matters, consider using a queue as your go-to data structure!