Queue_basic.java

package Queue;
public class Queue_basic {
    private int[] arr;
    private int front = 0;
    private int size = 0;

    public Queue_basic() {
        // TODO Auto-generated constructor stub
        arr = new int[5];
    }

    public Queue_basic(int n) {
        // TODO Auto-generated constructor stub
        arr = new int[n];
    }

    public boolean isEmpty() {
        return size == 0;
    }

    public boolean isfull() {
        return size == arr.length;
    }

    public void Enqueue(int item) throws Exception {
        if (isfull()) {
            throw new Exception("Bklol Queue full h");
        }
        int idx = (front + size) % arr.length;
        arr[idx] = item;
        size++;
    }

    public int dequeue() throws Exception {
        if (isEmpty()) {
            throw new Exception("Queue khali hai");
        }
        int rv = arr[front];
        front = (front + 1) % arr.length;
        size--;
        return rv;
    }

    public int GetFront() {
        int rv = arr[front];

        return rv;
    }

    public void Display() {
        for (int i = 0; i < size; i++) {
            int idx = (front + i) % arr.length;
            System.out.print(arr[idx] + " ");

        }

    }
}