Scribd
Upload
5 views

13. Data Structure and Algorithms - Queue

The document explains the queue data structure, which operates on a First-In-First-Out (FIFO) basis, allowing data to be added at one end (enqueue) and removed from the other (dequeue). It discusses basic operations associated with queues, including enqueue, dequeue, peek, isfull, and isempty, as well as the implementation of queues using arrays and linked lists. Real-world examples of queues are provided, such as waiting lines and traffic flow on a one-way road.

Uploaded by

natasha muunganirwa
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

13. Data Structure and Algorithms - Queue

The document explains the queue data structure, which operates on a First-In-First-Out (FIFO) basis, allowing data to be added at one end (enqueue) and removed from the other (dequeue). It discusses basic operations associated with queues, including enqueue, dequeue, peek, isfull, and isempty, as well as the implementation of queues using arrays and linked lists. Real-world examples of queues are provided, such as waiting lines and traffic flow on a one-way road.

Uploaded by

natasha muunganirwa
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Data Structure and

Algorithms - Queue
We are familiar with queue in our day to day life as we wait for a service.
The queue data structure also means the same where the data elements
are arranged in a queue. The uniqueness of queue lies in the way items
are added and removed. The items are allowed at on end but removed
form the other end. So it is a First-in-First out method. An queue can be
implemented using python list where we can use the insert() and pop()
methods to add and remove elements. Their is no insertion as data
elements are always added at the end of the queue.

Queue is an abstract data structure, somewhat similar to Stacks. Unlike


stacks, a queue is open at both its ends. One end is always used to
insert data (enqueue) and the other is used to remove data (dequeue).
Queue follows First-In-First-Out methodology, i.e., the data item stored
first will be accessed first.
A real-world example of queue can be a single-lane one-way road, where the vehicle enters
first, exits first. More real-world examples can be seen as queues at the ticket windows and
bus-stops.

Queue Representation

As we now understand that in queue, we access both ends for different reasons. The following diagram given
below tries to explain queue representation as data structure −

As in stacks, a queue can also be implemented using Arrays, Linked-lists, Pointers and Structures. For the sake
of simplicity, we shall implement queues using one-dimensional array.
Basic Operations

Queue operations may involve initializing or defining the queue, utilizing it,
and then completely erasing it from the memory. Here we shall try to
understand the basic operations associated with queues −
 enqueue() − add (store) an item to the queue.
 dequeue() − remove (access) an item from the queue.
Few more functions are required to make the above-mentioned queue
operation efficient. These are −
 peek() − Gets the element at the front of the queue without removing it.
 isfull() − Checks if the queue is full.
 isempty() − Checks if the queue is empty.
In queue, we always dequeue (or access) data, pointed by front pointer and
while enqueing (or storing) data in the queue we take help of rear pointer.
Enqueue Operation (Add)
Queues maintain two data pointers, front and rear. Therefore, its operations are
comparatively difficult to implement than that of stacks.
The following steps should be taken to enqueue (insert) data into a queue −

 Step 1 − Check if the queue is full.


 Step 2 − If the queue is full, produce overflow error and exit.
 Step 3 − If the queue is not full, increment rear pointer to point the next empty space.
 Step 4 − Add data element to the queue location, where the rear is pointing.
 Step 5 − return success.
Dequeue Operation (Remove)
Accessing data from the queue is a process of two tasks − access the data where front is
pointing and remove the data after access. The following steps are taken to
perform dequeue operation −
 Step 1 − Check if the queue is empty.
 Step 2 − If the queue is empty, produce underflow error and exit.
 Step 3 − If the queue is not empty, access the data where front is pointing.
 Step 4 − Increment front pointer to point to the next available data element.
 Step 5 − Return success.

You might also like