Queue.java

public class Queue {
   int[] arrs;
   int front;
   int rear;
   int size;

   public Queue(){
    arrs = new int[5];
    front = 0;
    rear = -1;
    size = 0;
   }


// insert element
   
    public void enqueue(int data ){
      if( isfull()){ 
        throw new RuntimeException("Queue is full");
      } 
         rear= (rear+1)%5;
         arrs[rear] = data;
         size++;
 
}


    // delete element 
    public int dequeue(){
        if (isempty()) {
             throw new RuntimeException("Queue is empty.");
        }
         int data = arrs[front];
         front = (front+1)%5;
             return data;
           
    }


    // to check queue is full 
    public boolean isfull()
    {
        return size ==  5;
    }
    

    // to check queue is empty
    public boolean isempty(){
        return size == 0;
    }


    // to  print peek element
    public int peek(){
        if (isempty()) {
            throw new RuntimeException("Queue is empty.");
        }
        return arrs[front];
    }
    
    public void display(){
        for(int i=front; i < size; i++){
            System.out.print(arrs[i] +" ");
        }
        System.out.println();
    }

}