Queues 48-59

5.1 Introduction to Queues

A queue is a fundamental linear data structure in computer science, which follows the First-In-First-Out (FIFO) principle. This means that the element inserted first is the one to be removed first, much like a real-world queue at a ticket counter. The queue data structure is essential for managing data in a sequential manner, ensuring that processing occurs in the order of arrival. Queues are widely used in various applications such as scheduling processes in operating systems, handling requests in web servers, and managing print jobs in printers. In a queue, insertion of elements is done at one end, called the rear, and deletion is performed from the other end, called the front. This separation ensures that the order of processing is strictly maintained. Queues can be implemented using arrays or linked lists, and they can be of different types such as simple queues, circular queues, priority queues, and double-ended queues (deques). Understanding queues is crucial for efficient data management and algorithm design.

• Queue follows the First-In-First-Out (FIFO) principle.
• Insertion occurs at the rear, and deletion occurs at the front.
• Queues are used in scheduling, buffering, and resource management.
• Can be implemented using arrays or linked lists.
• Different types include simple, circular, priority, and double-ended queues.
• Helps maintain the order of processing in various applications.
• 📌 Queue: A linear data structure following FIFO order.
• 📌 FIFO: First-In-First-Out, the order in which elements are processed.
• 📌 Front: The end of the queue from which elements are removed.

5.2 Queue Operations

Queue operations are the fundamental actions that can be performed on a queue data structure. The two primary operations are enqueue (insertion) and dequeue (deletion). Enqueue adds an element to the rear of the queue, while dequeue removes an element from the front. Additional operations include checking if the queue is empty or full, peeking at the front element without removing it, and displaying the contents of the queue. These operations ensure the proper functioning and management of the queue, maintaining the FIFO order. The implementation of these operations may vary depending on whether the queue is implemented using arrays or linked lists. Proper handling of edge cases, such as underflow (deleting from an empty queue) and overflow (inserting into a full queue), is essential for robust queue management.

• Enqueue inserts an element at the rear of the queue.
• Dequeue removes an element from the front of the queue.
• Peek allows viewing the front element without removing it.
• isEmpty checks if the queue has no elements.
• isFull checks if the queue has reached its maximum capacity.
• Proper handling of underflow and overflow is necessary.
• 📌 Enqueue: Operation to insert an element at the rear.
• 📌 Dequeue: Operation to remove an element from the front.
• 📌 Underflow: Attempting to remove from an empty queue.