Scribd
Upload
19 views4 pages

Our DSA Lab 7

This document outlines a lab session for implementing a queue using a linked list as part of a Data Structures and Algorithms course. It explains the limitations of array-based queues and provides a detailed algorithm for enqueueing, dequeueing, and displaying queue elements. The document includes a sample code implementation in C++ demonstrating these operations.

Uploaded by

talhahaneef4037
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views4 pages

Our DSA Lab 7

This document outlines a lab session for implementing a queue using a linked list as part of a Data Structures and Algorithms course. It explains the limitations of array-based queues and provides a detailed algorithm for enqueueing, dequeueing, and displaying queue elements. The document includes a sample code implementation in C++ demonstrating these operations.

Uploaded by

talhahaneef4037
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

The Islamia University of Bahawalpur

Faculty of Engineering

BS Cyber Security and Digital Forensics ______ semester


Lab # 7 Queue implementation using linked list
Course: Data Structures and Algorithms lab Date:
Submitted by: Roll No.

Objectives

The purpose of this lab session is to understand the implementation of a queue using linked list.

Introduction

The major problem with the queue implemented using array is, it will work for only fixed
number of data. That means, the amount of data must be specified in the beginning itself.
Queue using array is not suitable when we don't know the size of data which we are going to
use. A queue data structure can be implemented using linked list data structure. The queue
which is implemented using linked list can work for unlimited number of values. That means,
queue using linked list can work for variable size of data (No need to fix the size at beginning of
the implementation). The Queue implemented using linked list can organize as many data
values as we want.

In linked list implementation of a queue, the last inserted node is always pointed by 'rear' and
the first node is always pointed by 'front'.

Figure 1: Example

In the above example, the last inserted node is 50 and it is pointed by 'rear' and the first
inserted node is 10 and it is pointed by 'front'. The order of elements inserted is 10, 15, 22 and
50.

Operations
To implement queue using linked list, we need to set the following things before implementing
actual operations.
 Step 1: Include all the header files which are used in the program. And declare all
the user defined functions.
 Step 2: Define a 'Node' structure with two members, data and next.
 Step 3: Define two Node pointers 'front' and 'rear' and set both to NULL.
 Step 4: Implement the main method by displaying Menu of list of operations and make
suitable function calls in the main method to perform user selected operation.
enQueue(value) - Inserting an element into the Queue
We can use the following steps to insert a new node into the queue...
 Step 1: Create a newNode with given value and set 'newNode → next' to NULL.
 Step 2: Check whether queue is Empty (rear == NULL)
 Step 3: If it is Empty then, set front = newNode and rear = newNode.
 Step 4: If it is Not Empty then, set rear → next = newNode and rear = newNode.

deQueue() - Deleting an Element from Queue


We can use the following steps to delete a node from the queue...
 Step 1: Check whether queue is Empty (front == NULL).
 Step 2: If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and
terminate from the function
 Step 3: If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
 Step 4: Then set 'front = front → next' and delete 'temp' (free(temp)).

display() - Displaying the elements of Queue


We can use the following steps to display the elements (nodes) of a queue...
 Step 1: Check whether queue is Empty (front == NULL).
 Step 2: If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
 Step 3: If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
 Step 4: Display 'temp → data --->' and move it to the next node. Repeat the same until
'temp' reaches to 'rear' (temp → next != NULL).
 Step 4: Finally! Display 'temp → data ---> NULL'.

Tasks:

1. Implement a queue using the algorithm provided above.

Code:

#include <iostream>
using namespace std;

class queue
{
public:
queue *front=0,*rear=0;
int info;
queue *next;

queue()
{
next=0;
}

queue(int i)
{
info=i;
next=0;
}

int isempty();
void enqueue(int d);
int dequeue();
void display_items();
};

int queue_size=10;

int queue :: isempty()


{
if(front == 0)
{
return 1;
}
else
{
return 0;
}
}

void queue :: enqueue(int d)


{
if(rear==0)
{
front=rear=new queue(d);
}
else
{
queue *temp=new queue(d);
rear->next=temp;
rear=rear->next;
}
}

int queue :: dequeue()


{
int out=front->info;
if (isempty())
{
return 0;
}
if (front==rear)
{
delete front;
front=rear=0;
}
else
{
queue *temp=front;
front=front->next;
delete temp;
}
return 0;
}

void queue :: display_items()


{
queue *temp=front;
while (temp!=0)
{
cout<<temp->info<<endl;
temp=temp->next;
}
}

int main()
{
queue st;
st.enqueue(25);
st.enqueue(55);
st.enqueue(15);
st.enqueue(35);

st.dequeue();

st.display_items();
return 0;
}

Output:

55
15
35

You might also like