/*eduLanka Online education web site of Sri Lanka -------- w w w . e d u L a n k a . c o m ------------ java programs for University students - who follow courses - BIT - SLIIT and more find more lessons in http://www.it.edulanka.com eduLanka@gmail.com this programs under GNU licence */ class Queue1{ public int rear; public int front; public int size; int q[]; public void makeEmpty(){ rear=-1; front=0; size=0; } public Queue1(){ q=new int[10]; makeEmpty(); } public boolean isEmpty(){ return size==0; } public boolean isFull(){ return size==q.length-1; } public void enQueue(int x){ if(isFull()) System.out.println("Queue is Full"); else{ rear++; q[rear]=x; size++; } } public void deQueue(){ int ele=-1; if(isEmpty()) System.out.println("Queue is Empty"); else{ ele=q[front++]; size--; } // return ele; } public void printQueue(){ System.out.println(" Queue Elements \n"); for(int i=front;i<=rear;i++){ System.out.println(q[i]); } } } public class MyQueue{ public static void main(String arg[]){ Queue1 que=new Queue1(); que.enQueue(60); que.enQueue(20); que.enQueue(84); que.enQueue(54); que.enQueue(74); que.enQueue(04); System.out.print("\nAfter enQueue :"); que.printQueue(); que.deQueue(); que.deQueue(); System.out.print("\nAfter two deQueues :"); que.printQueue(); } }