Question

//Look for** to complete this program --C+ please --please add comments // using namespace std; #include #include #include #include "queue.h" //Purpose of the program: ** Algorithm: * int main() /** "A", "B", "C" in the queue //** while loop -- indefinitely { try {//** catches } //* end of loop } |/ II II II II II //File type: ** queue.cpp using namespace std; #include #include "queue.h" // constructor queue::queue () } //destructor queue::~queue() queue::queue { } //destructor queue: queue() // nothing } // PURPOSE: returns true if queue is empty, otherwise false bool queue::isEmpty() { } // PURPOSE: returns true if queue is full, otherwise false bool queue::isFull // PURPOSE: if full, throws an exception Overflow // if not full, enters an element at the rear // PAREMETER: provide the element (newElem) to be added void queue::add(el_t newElem) // PURPOSE: if empty, throw Underflow // if not empty, removes the front element to give it back // PARAMETER: provide a holder (removedElem) for the element removed (pass by ref) // PARAMETER: provide a holder (removed Elem) for the element removed (pass by ref) void queue::remove (el_t& removed Elem) // PURPOSE: if empty, throws an exception Underflow // if not empty, give back the front element (but does not remove it) //PARAMETER: provide a holder (theElem) for the element (pass by ref) void queue::frontElem(el_t& theElem) / PURPOSE: returns the current size to make it // accessible to the client caller int queue::getSize () // PURPOSE: display everything in the queue horizontally //from front to rear enclosed in [ // if empty, displays [empty ] void queue::displayAll if (isEmpty) cout

Answer 1

Below is the code for Queue operation using an array -->

#include <iostream>

#include<stdlib.h>

#include<string>

using namespace std;

typedef string el_t;

const int MAX_SIZE = 10;

// Purpose of this program : Implement the operations of queue using an array

// Algorithm :

class Queue {

private :

el_t el[MAX_SIZE];

int front, back;

public :

Queue();

~Queue();

bool isEmpty();

bool isFull();

void add(el_t);

void removeElem(el_t&);

void frontElem(el_t&);

int getSize();

void displayAll();

void goToBack();

};

// constructor

Queue::Queue()

{

front = back = 0;

}

// destructor

Queue::~Queue() { }

bool Queue::isEmpty()

{

return (front == back);

}

bool Queue::isFull()

{

return (back == MAX_SIZE);

}

void Queue::add(el_t newElement)

{

if (isFull()) {

throw "Overflow exception";

}

// insert element at the back

else {

el[back] = newElement;

back++;

}

}

void Queue::removeElem(el_t &removedElem)

{

if (isEmpty())

{

throw "Underflow exception";

}

else

{

removedElem = el[front];

for (int i = 0; i < back - 1; i++) {

el[i] = el[i + 1];

}

// decrement back of the queue

back--;

}

}

void Queue::frontElem(el_t& frontElem)

{

if (isEmpty())

{

throw "Underflow exception";

}

else

{

frontElem = el[front];

}

}

int Queue::getSize()

{

return back + 1;

}

void Queue::displayAll()

{

int i = front;

if (isEmpty()) {

cout<<"[ empty ]"<<endl;

}

else

{

cout<<"[";

for (i = front; i < back; i++) {

cout<<"<-- "<<el[i];

}

cout<<"]";

}

}

void Queue::goToBack()

{

if (isEmpty())

{

throw "Underflow exception";

}

else

{

int arraySize = sizeof(el)/sizeof(el[0]);

if (arraySize > 1)

{

el_t removedElement;

removeElem(removedElement);

add(removedElement);

}

}

}

int main() {

Queue q;

q.add("A");

q.add("B");

q.add("C");

// Intial printing

q.displayAll();

el_t removedElem;

try {

// removing element from front

q.removeElem(removedElem);

// adding element at back

q.add(removedElem);

// print queue after insertion and deletion

q.displayAll();

} catch (exception& e){

cout<<e.what();

} return 0;

}