Queue Array

Queue Array

1. QueueArrayImpl.java

 package com.nrs.ds.basic;  
 public class QueueArrayImpl<T> {  
      Object[] ArrayQueue;  
      int Rear;  
      int Front;  
      int size;  
      public QueueArrayImpl(int size){  
           this.size = size;  
           ArrayQueue = new Object[this.size];  
           Front = -1;  
           Rear = -1;  
      }  
   public Boolean isFull(){  
        return (Rear == size-1);  
   }  
   public Boolean isEmpty(){  
        return (Rear == -1 || Front > Rear);  
   }  
   public void queue(Object newItem){  
        if(isFull()){  
             System.out.println("Queue is full");  
             return;  
        }  
        Rear = Rear +1;  
        ArrayQueue[Rear] = newItem;  
        if(Front == -1){  
             Front = 0;  
        }  
   }  
   public T deQueue(){  
        if(isEmpty()){  
             System.out.println("Queue is Empty");  
             return null;  
        }  
        T ObejctOut = (T) ArrayQueue[Front];  
        Front = Front + 1;  
        return ObejctOut;  
   }  
 }  

2. Test

 package com.nrs.ds.basic;  
 public class QueueArrayTest {  
      public static void main(String[] args) {  
           QueueArrayImpl<Integer> qa = new QueueArrayImpl<Integer>(5);  
           qa.queue(2);  
           qa.queue(01);  
           qa.queue(3);  
           qa.queue(4);  
           qa.queue(-1);  
           System.out.println("Dequeu :"+qa.deQueue());  
           System.out.println("Dequeu :"+qa.deQueue());  
      }  
 }  

Output :