[go: up one dir, main page]
Scribd
Upload
32 views2 pages

Qarray Maxsize Front Rare: Public Class Public Long Public Int Public Int Public Int Public Int

This document defines a queue class with methods for enqueue, dequeue, and display. The queue class contains a maxsize variable to track the maximum size, a QArray to store elements, and front and rare pointers to track the front and rear of the queue. The main method creates a queue with size 7, enqueues elements 1-7, displays the queue, deletes two elements, and displays the queue again.

Uploaded by

areej
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
32 views2 pages

Qarray Maxsize Front Rare: Public Class Public Long Public Int Public Int Public Int Public Int

This document defines a queue class with methods for enqueue, dequeue, and display. The queue class contains a maxsize variable to track the maximum size, a QArray to store elements, and front and rare pointers to track the front and rear of the queue. The main method creates a queue with size 7, enqueues elements 1-7, displays the queue, deletes two elements, and displays the queue again.

Uploaded by

areej
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/ 2

public class queue {

public long[]QArray;
public int maxsize;
public int front;
public int rare;

public queue(int max)


{
//this.maxsize=QArray;
// QArray=new long[maxsize];
//rare=-1;
//front=-1;
maxsize=max;
QArray=new long[maxsize];
rare=-1;
front=-1;
}
//public void enqueue(int y) {

//}
public void enqueue(long x)
{
if(rare==maxsize-1)
{
System.out.println("queue is full");
}
if(rare==-1&&front==-1)
{
front=0;rare=0;
QArray[rare]=x;
}
else
{
rare++;
QArray[rare]=x;
}
}

public long Qdelete()


{
long temp=QArray[front];
if(front==-1&&rare==-1)
{
System.out.println("queue is empty");
}
else if(rare==front) {
rare=front=-1;
}
else
{
front++;
}
return temp;
}

void display() {
for(int i=front;i<=rare;i++)
System.out.println(QArray[i] +"");
}

public static void main(String[] args) {


// TODO Auto-generated method stub
System.out.println("\t\t\t\t$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
$$$$$$");
System.out.println("");
System.out.println("\t\t\t\t$\t\t\t\t\t\t\t $");
System.out.println(" \t\t\t\t\t\t********** HOME TASK **********\t\t\t\t\t
");
System.out.println("\t\t\t\t$\t\t\t\t\t\t\t $");
System.out.println("\t\t\t\t\t************ Task Name:Queue **********\t\t\t\t");
System.out.println("\t\t\t\t$\t\t\t\t\t\t\t $");
System.out.println("\t\t\t\t\t************ Submitted By: Muqaddas Ehsan
**********\t\t\t\t");
System.out.println("\t\t\t\t$\t\t\t\t\t\t\t $");
System.out.println("\t\t\t\t\t********** Submitted To: Sir Umar
**********\t\t\t\t\t");
System.out.println("");
System.out.println("\t\t\t\t$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
$$$$$$");

queue myqueue;
myqueue=new queue(7);
myqueue.enqueue(1);
myqueue.enqueue(2);
myqueue.enqueue(3);
myqueue.enqueue(4);
myqueue.enqueue(5);
myqueue.enqueue(6);
myqueue.enqueue(7);

myqueue.display();
// myqueue.enqueue(x);
System.out.print("Deleted elements are: ");
myqueue.Qdelete();
myqueue.Qdelete();
myqueue.display();

You might also like