**JAVA** Queue ADT that uses an array internally (Call it AAQueue) Solution /*Java Code for Queue ADT implementation using Arrays*/ import java.util.Scanner; class Queue { /*array AAQueue -> hold queue elements*/ int AAQueue[] = new int[10]; int ffront,rrear; Queue() { ffront=0; rrear=-1; } void insert(int number) { //insert element at rear end of queue if it is not fulll*/ if(rrear==9) System.out.println(\"Queue overflow\"); else { AAQueue[++rrear]=number; System.out.println(number + \" inserted in Queue\"); } } int empty() {/*Return 1 if queue is empty and 0 otherwise*/ return(rrear<ffront? 1:0); } void remove() {/*remove one element from front if queue is not empty */ if(empty()==1) System.out.println(\"Underflow Queue\"); else System.out.println(\"Element removed : \"+AAQueue[ffront++]); } void print() {/*print all elements from ffront to rrear end of queue*/ if(empty()==0) { System.out.print(\"Queue : \"); int temp=ffront; while(temp<=rrear) System.out.print(\" \"+AAQueue[temp++]); System.out.println(); } }/*end print*/ public static void main(String args[]) { Scanner scan = new Scanner(System.in); Queue queue = new Queue(); int temp,number; while(true) { System.out.println(\"\ \\tQUEUE\"); System.out.println(\"1.Insert\"); System.out.println(\"2.Remove\"); System.out.println(\"3.Display\"); System.out.println(\"4.Exit\"); System.out.print(\"Enter your choice : \"); temp=scan.nextInt(); switch(temp) { case 1:System.out.print(\"Enter number : \"); number=scan.nextInt(); queue.insert(number); break; case 2:queue.remove(); break; case 3:queue.print(); break; case 4:return; } } } } .

1. **JAVA**
Queue ADT that uses an array internally (Call it AAQueue)
Solution
/*Java Code for Queue ADT implementation using Arrays*/
import java.util.Scanner;
class Queue
{
/*array AAQueue -> hold queue elements*/
int AAQueue[] = new int[10];
int ffront,rrear;
Queue()
{
ffront=0;
rrear=-1;
}
void insert(int number)
{ //insert element at rear end of queue if it is not fulll*/
if(rrear==9)
System.out.println("Queue overflow");
else
{
AAQueue[++rrear]=number;
System.out.println(number + " inserted in Queue");
}
}
int empty()
{/*Return 1 if queue is empty and 0 otherwise*/

2. return(rrear<ffront? 1:0);
}
void remove()
{/*remove one element from front if queue is not empty */
if(empty()==1)
System.out.println("Underflow Queue");
else
System.out.println("Element removed : "+AAQueue[ffront++]);
}
void print()
{/*print all elements from ffront to rrear end of queue*/
if(empty()==0)
{
System.out.print("Queue : ");
int temp=ffront;
while(temp<=rrear)
System.out.print(" "+AAQueue[temp++]);
System.out.println();
}
}/*end print*/
public static void main(String args[])
{
Scanner scan = new Scanner(System.in);
Queue queue = new Queue();
int temp,number;
while(true)
{
System.out.println(" tQUEUE");
System.out.println("1.Insert");
System.out.println("2.Remove");
System.out.println("3.Display");
System.out.println("4.Exit");
System.out.print("Enter your choice : ");
temp=scan.nextInt();
switch(temp)
{
case 1:System.out.print("Enter number : ");
number=scan.nextInt();
queue.insert(number);

3. break;
case 2:queue.remove();
break;
case 3:queue.print();
break;
case 4:return;
}
}
}
}