A queue is a fundamental data structure in computer science that follows the First-In-First-Out (FIFO) principle. This means that the first element added to the queue will be the first one to be removed. It operates like a line where elements are added at one end (rear) and removed from the other end (front)¹.

Basic Operations of Queue

1. Enqueue (Insert): Adds an element to the rear of the queue.

2. Dequeue (Delete): Removes and returns the element from the front of the queue.

3. Peek: Returns the element at the front of the queue without removing it.

4. Empty: Checks if the queue is empty.

5. Full: Checks if the queue is full¹.

Applications of Queue

Queues are widely used in various applications due to their simplicity and efficiency in managing data flow. Some common applications include:

• Task scheduling in operating systems.

• Data transfer in network communication.

• Simulation of real-world systems, such as waiting lines.

• Priority queues for event processing¹.