Scribd Logo
Upload

Welcome to Scribd!

  • Doublyended

    Uploaded by

    Aayush Upadhyay
    4 views3 pages
    The document defines a doublyqueue class that implements a queue with both front and rear enqueue and dequeue operations. It has methods to add elements to the front and rear of the queue, remove elements from the front and rear, and check if the queue is empty or full. Main tests the class by adding elements to both ends, removing elements from both ends, and checking the front and rear elements.

    Original Description:

    Original Title

    doublyended

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines a doublyqueue class that implements a queue with both front and rear enqueue and dequeue operations. It has methods to add elements to the front and rear of the queue, remove elements from the front and rear, and check if the queue is empty or full. Main tests the class by adding elements to both ends, removing elements from both ends, and checking the front and rear elements.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views3 pages

    Doublyended

    Uploaded by

    Aayush Upadhyay
    The document defines a doublyqueue class that implements a queue with both front and rear enqueue and dequeue operations. It has methods to add elements to the front and rear of the queue, remove elements from the front and rear, and check if the queue is empty or full. Main tests the class by adding elements to both ends, removing elements from both ends, and checking the front and rear elements.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    class doublyqueue {

    static final int MAX = 100;


    int arr[];
    int front, rear, maxsize;

    public doublyqueue(int size) {


    arr = new int[MAX];
    front = -1;
    rear = 0;
    this.maxsize = MAX;
    }
    boolean isempty() {
    if (front == -1)
    return true;
    else
    return false;
    }
    boolean isfull() {
    return ((front == 0 && rear == maxsize -1) || front == rear+1);
    }
    void enqueuefront(int element) {
    if (isfull()) {
    System.out.println("OVERFLOW");
    return;
    }
    if (front == -1) {
    front = 0;
    rear = 0;
    }
    else if (front == 0){
    System.out.println("front = 0");

    front = maxsize -1;


    }
    else {
    System.out.println("front = -1");
    front = front-1;

    }
    arr[front] =element;
    }

    void enqueuerear(int element) {


    if (isfull()) {
    System.out.println("OVERFLOW");
    return;
    }
    if (front == -1) {
    front = 0;
    rear = 0;
    }
    else if (rear ==maxsize -1)
    rear = 0;
    else
    rear = rear + 1;
    arr[rear] =element;
    }

    void dequeuefront() {
    if (isempty()) {
    System.out.println("empty queue");
    return;
    }
    if (front==rear) {
    front = -1;
    rear = -1;
    }
    else if (front == maxsize -1)
    front = 0;
    else
    front = front +1;
    }

    void dequeuerear() {
    if (isempty()) {
    System.out.println("empty queue");
    return;
    }
    if (front==rear) {
    front = -1;
    rear = -1;
    }
    else if (rear ==0)
    rear = maxsize - 1;
    else
    rear = rear -1;
    }

    int getFront() {
    if (isempty()) {
    System.out.println(" Underflow");
    return -1;
    }
    return arr[front];
    }

    int getRear() {
    if (isempty() || rear < 0) {
    System.out.println(" Underflow\n");
    return -1;
    }
    return arr[rear];
    }

    public static void main(String[] args) {


    doublyqueue dq = new doublyqueue(5);
    System.out.println("Insert element at rear end : 15 ");
    dq.enqueuerear(15);
    System.out.println("insert element at rear end : 12 ");
    dq.enqueuerear(12);

    System.out.println("get rear element : " + dq.getRear());

    dq.dequeuerear();
    System.out.println("After delete rear element new rear become : " +
    dq.getRear());

    System.out.println("inserting element at front end");


    dq.enqueuefront(20);

    System.out.println("get front element: " + dq.getFront());

    dq.dequeuefront();

    System.out.println("After delete front element new front become : " +


    dq.getFront());

    }
    }

    OUTPUT

    Insert element at rear end : 15


    insert element at rear end : 12
    get rear element : 12
    After delete rear element new rear become : 15
    inserting element at front end
    front = 0
    get front element: 20
    After delete front element new front become : 15

    You might also like