Scribd
Upload
95 views2 pages

Java Queue Implementation Example

This Java code defines a Queue class with methods to add and remove elements, check if the queue is full or empty, and display the queue. It uses an array to store the queue elements, with front and rear pointers to track the first and last elements. The main method runs an interactive menu to test the queue by allowing the user to add/remove elements and view the queue.

Uploaded by

Deep Patel
Copyright
© Attribution Non-Commercial (BY-NC)
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
95 views2 pages

Java Queue Implementation Example

This Java code defines a Queue class with methods to add and remove elements, check if the queue is full or empty, and display the queue. It uses an array to store the queue elements, with front and rear pointers to track the first and last elements. The main method runs an interactive menu to test the queue by allowing the user to add/remove elements and view the queue.

Uploaded by

Deep Patel
Copyright
© Attribution Non-Commercial (BY-NC)
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

import [Link].

*; public class Queue { final int MAX=10; int arr[]; int front,rear; public Queue() { arr=new int[MAX]; front=rear=-1; } public boolean isFull() { if(rear==(MAX-1)) return true; else return false; } public boolean isEmpty() { if(front==-1) return true; else return false; } public void enqueue(int n) {if(isFull()) [Link]("****Queue overflow******"); else { rear++; arr[rear]=n; if(front==-1) front=0; [Link]("******Element added to the queue*****"); } } public int dequeue() { int x; if(isEmpty()) x=-999; else { x=arr[front]; arr[front]=0; if(front==rear) front=rear=-1; else front++; } return x; } public void show() { if(isEmpty()) [Link]("****Empty*****"); else

{ for (int i=front;i<=rear;i++) [Link](arr[i]+" } [Link](); } public static void main(String args[]) throws IOException { Queue obj=new Queue(); BufferedReader br = new BufferedReader(new InputStreamReader([Link])); int n=0, ch=0; do { [Link]("Enter 1 for adding an element to a queue"); [Link]("Enter 2 for deleting an element from a queue"); [Link]("Enter 3 for showing elements of a queue"); [Link]("Enter 4 for exit"); [Link]("Enter your choice"); ch=[Link]([Link]()); switch (ch) { case 1: [Link]("Enter an integer to be added to the queue"); n=[Link]([Link]()); [Link](n); break; case 2: n=[Link](); if(n==-999) [Link]("******Queue underflow******"); else [Link]("****Element deleted is: "+n+" ******"); break; case 3: [Link]("******Queue status*******"); [Link](); break; case 4: [Link]("*****Program terminates******"); [Link](0); default: [Link]("****Wrong code. please enter code 1 to 4 only****"); } }while(ch!=4); } } ");

You might also like