PRESIDENCY UNIVERSITY

Bengaluru, Karnataka
Computer Science & Engineering
School of Computer Science & Engineering

Subject: CSE2001 - Data Structures & Algorithms Semester: III

Date: 23/09/2023

Implementation of Queue using Arrays

import java.util.*;
public class queue_operations
{
static int value, rear=-1,front=-1,queue[]=new int[5],ch,i,choice;
// rear variable is used to insert element into queue, initialised to -1.

//front variable is used to delete element from queue, initialised to -1.

static void enqueue() //enqueue means inserting elements

{
Scanner sc1=new Scanner(System.in);
System.out.println("Enter the value to be inserted");
value=sc1.nextInt(); // integer value entered by user is stored in variable value
if(rear==4) // This condition checks for Queue overflow

{
System.out.println("Queue Overflow");
}
else if(front==-1 && rear==-1) // This condition checks for Queue empty and inserts first element in queue

front=0;
rear=0;
queue[rear]=value; //First element is inserted into queue

Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 1
 }
else //This code inserts remaining elements into queue

{
rear=rear+1; //First increment rear variable and then insert element

queue[rear]=value;

}
}
public void dequeue() //dequeue means deleting elements

{
if(rear==-1 && front==-1) //Checks for Queue underflow, when rear=-1 and front=-1 indicates no elements are in queue

{
System.out.println("Queue is underflow");
}

else if(front==rear) //This condition checks when queue has only one element

{
System.out.println("Element deleted is:"+queue[front]);
front=rear=-1;
}
else //Removes elements of queue

{
System.out.println("Element deleted is:"+queue[front]);
front=front+1;

Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 2
 }
}

public void display()

{
if(rear==-1 && front==-1) //Displays no elements, because queue is empty

{
System.out.println("Queue is empty");
}
else //Displays all elements of Queue

{
System.out.println("The elements of Queue are");
for(i=front;i<=rear;i++)
{
System.out.println(queue[i]);
}
}
}
public static void main(String args[]) //main function

{
Scanner sc=new Scanner(System.in);
queue_operations obj=new queue_operations();
System.out.println("Implementation of Queue operations");
ch=1;
while(ch==1)
{
System.out.println("Enter your choice");
System.out.println("1.Enqueue\n2.Dequeue\n3.Traversal\n4.Exit");

Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 3
 choice=sc.nextInt();
switch(choice)
{
case 1: obj.enqueue(); //method invocation

break;
case 2: obj.dequeue(); //method invocation

break;
case 3: obj.display(); //method invocation

break;
case 4: System.out.println("Enter 1 to continue or 0 to exit");
ch=sc.nextInt();
break;
}
}
}
}
Output:

Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 4
Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 5
Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 6
Prepared by,
Ms. Sridevi S, AP/SoCSE, Ms. Meena Kumari, AP/SoCSE, Ms. Rohini A, AP/SoCSE 7