Java Program on Queues using Arrays
class QueuesArrays { public static void main(String args[] )throws IOException { BufferedReader br=new BufferedRead...
https://www.computersprofessor.com/2016/11/java-program-on-queues-using-arrays.html
class QueuesArrays
{
public static void main(String
args[] )throws IOException
{
BufferedReader br=new BufferedReader
(new InputStreamReader(System.in));
int n;
System.out.println(“enter Queue
size”);
n= Integer.parseInt (br.readLine);
int Qu[]=new int [n];
int front = - 1, rear = -1 ,ch;
do
{
System.out.println(“1:
creation 2: deletion 3:display”);
System.out.println(“enter your
choice”);
ch= Integer.parseInt
(br.readline());
switch(ch)
{
case 1:
if (rear < n – 1)
{
if(front == -1)
{
System.out.println(“enter
element”);
Qu[++rear]= Integer.parseInt
(br.readLine());
front=rear;
}
else
{
System.out.println(“enter
element”);
Qu[++rear]= Integer.parseInt
(br.readLine());
}
}
else
{
System.out.println(“queue is full”);
}
break;
case 2:
if(front == -1)
{
System.out.println(“queue is
empty”);
}
else
{
System.out.println(“element”+Qu[front]+”deleted”);
for(i=front;i
{
Qu[i]=Qu[i+1];
}
rear=rear – 1;
}
break;
case 3:
System.out.println(“1.display from
rear 2: display from front”);
System.out.println(“enter ur
choice”);
int op=Integer.parseInt(br.readLine());
switch(op)
{
case 1:
if(front!= -1)
{
for(i=rear; i!= - 1;i++)
{
System.out.println(Qu[i]);
}
}
else
{
System.out.println(“queue is empty”);
}
break;
case 2:
if(front != - 1)
{
for(i=front;i<=rear;i++)
{
System.out.println(Qu[i]);
}
}
else
{
System.out.println(“queue is empty”);
}
break;
}
break;
}while( ch < 4 );
}
}
