Hey there I am to copy going to copy my function and please tell me how do imple

Question

Hey there I am to copy going to copy my function and please tell me how do implement the circular queue

#include<iostream>

#include<string>
#include "queues.h"
using namespace std;

queue::queue()
{
front=0;
rear=0;
}

queue::~queue(){}

void queue::enqueue(string name)
{
if(isfull())
{
cout<<"Queue is full. No insertion allowed further."<<endl;
return;
}
names[rear] = name;
rear++;
}


void queue::enqueue(string name, bool premium)
{
if(isfull())
{
cout<<"Queue is full. No insertion allowed further."<<endl;
return;
}
if(premium == true)
{

string oldName = "";

for(int i = front; i < rear; i++)
{
oldName = names[i];
names[i] = name;
name = oldName;
}

}

names[rear] = name;
rear++;


}


string queue:: dequeue()
{
if(isempty())
{
cout<<"Queue is empty. Value returned from the queue will be garbage."<<endl;
exit(0);
}

return(names[front++]);
}

int queue::isempty()
{
if(front == rear)
return 1;
else
return 0;
}

int queue::isfull()
{
if(rear == SIZE)
return 1;
else
return 0;
}

void queue::displayQueue()
{

cout<<"QUEUE:"<<endl;
for(int i = front; i < rear; i++)
{
cout<< names[i] << endl;
}
}

Explanation / Answer

#include #include #define MAX_SIZE 4 using namespace std; class Queue{ private: int item[MAX_SIZE]; int head; int tail; public: Queue(); void enqueue(int); int dequeue(); int size(); void display(); bool isEmpty(); bool isFull(); }; Queue::Queue(){ head = 0; tail = 0; } void Queue::enqueue(int data){ item[tail] = data; tail = (tail+1)%MAX_SIZE; } int Queue::dequeue(){ int temp; temp = item[head]; head = (head+1)%MAX_SIZE; return temp; } int Queue::size(){ return (tail - head); } void Queue::display(){ int i; if(!this->isEmpty()){ for(i=head; i!=tail; i=(i+1)%MAX_SIZE) { cout

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---