Question

Define a class for static Queue for storing integer numbers. Your class must include a constructor, a destructor, enqueue, dequeue, display, isFull, and isEmpty functions. Write a simple main function in your program that demonstrates the class

Answer 1

Talll. PP https://Petty Serpentine Flashdrive-1.a Savcu return numElements == 0; int size() { return numElements; clang version 7.0.0-3-ubuntu final) > clang++-7 -pthread -o mair 3./main 1 2 3 4 }; int main() { Queue myQueue (4); my Queue. enqueue (1); myQueue.enqueue (2); my Queue. enqueue (3); my Queue. enqueue (4); myQueue.display(); cout << my Queue.isFull() << endl; cout << myQueue. isEmpty() << endl; 100 cout << myQueue. dequeue () << endl; cout << my Queue. dequeue () << endl; cout << my Queue.dequeue() << endl; cout << my Queue. dequeue () << endl; 101 102 103 104 105 106 107 108 109 cout << myQueue. isFull() << endl; cout << myQueue.isEmpty() << endl;

#include <iostream>

using namespace std;

class Queue {
    int *arr;
    int queueFront;
    int queueRear;
    int capacity;
    int numElements;

public:

    Queue(int size) {
        capacity = size;        
        arr = new int[capacity];
        queueFront = -1;
        queueRear = -1;
        numElements = 0;
    }

    ~Queue() {
        delete [] arr;
    }

    void enqueue(int value) {
        if ((queueFront == 0 && queueRear == capacity-1) ||
            (queueRear == (queueFront-1)%(capacity-1))) {
            //Queue is Full
            return;
        } else if(queueFront == -1) {
            // empty queue
            queueFront = queueRear = 0;
            arr[queueRear] = value;
        }  else if(queueRear == capacity-1 && queueFront != 0) {
            queueRear = 0;
            arr[queueRear] = value;
        }  else {
            queueRear += 1;
            arr[queueRear] = value;
        }
        numElements++;
    }

    int dequeue() {
        if(queueFront == -1) {
            // empty queue.
            return -1;
        }
        int data = arr[queueFront];
        
        if(queueFront == queueRear) {
            // single element
            queueFront = -1;
            queueRear = -1;
        } else if (queueFront == capacity-1) {
            queueFront = 0;
        } else {
            queueFront++;
        }
        numElements--;
        return data;
    }

    void display() {
        int i = queueFront;
        int count = 0;
        while(count < numElements) {
            int index = (i + count) % numElements;
            cout << arr[index] << " ";
            count++;
        }
        cout << endl;
    }

    bool isFull() {
        return numElements == capacity;
    }
    bool isEmpty () {
        return numElements == 0;
    }

    int size() {
        return numElements;
    }
};

int main() {
    Queue myQueue(4);

    myQueue.enqueue(1);
    myQueue.enqueue(2);
    myQueue.enqueue(3);
    myQueue.enqueue(4);

    myQueue.display();

    cout << myQueue.isFull() << endl;
    cout << myQueue.isEmpty() << endl;

    cout << myQueue.dequeue() << endl;
    cout << myQueue.dequeue() << endl;
    cout << myQueue.dequeue() << endl;
    cout << myQueue.dequeue() << endl;

    cout << myQueue.isFull() << endl;
    cout << myQueue.isEmpty() << endl;

}

**************************************************

Thanks for your question. We try our best to help you with detailed answers, But in any case, if you need any modification or have a query/issue with respect to above answer, Please ask that in the comment section. We will surely try to address your query ASAP and resolve the issue.

Please consider providing a thumbs up to this question if it helps you. by Doing that, You will help other students, who are facing similar issue.