Answered: #include using namespace std; class…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Basic Queue

Please help me debug and finish this code, it should do the functions under the int main().

#include<bits/stdc++.h>
using namespace std;

class Qcontainer{
int *Qarr;
int front;
int rear;
int capacity;

public:
//constructor
Qcontainer(int Qsize);

//desctructor
~Qcontainer();

//dequeue:int front value, no param
int dequeue(){
if(isEmpty()){
cout << "Underflow";
return 0;
}

cout << "Removing " << Qarr[front] << endl;
int temp = Qarr[front];

int i = front;
while(i<=rear){
Qarr[i] = Qarr[++i]
i++;
}
Qarr[rear] = NULL;
rear = --rear;
return temp;
}

//enqueue:bool add rear value, int data
bool enqueue(int newData){
if(isFull){
cout << "Overflow" << endl;
return false;
}

cout << "Inserting " << newData << endl;
rear = ++rear;
Qarr[rear] = newData;
return true;
}

//front:int return front val, no param
int front(){
return Qarr[front];
}

//isempty:bool, no parameter
bool isEmpty(){
return (rear == -1);
}

//isfull:bool, no parameter
bool isFull(){
return rear==capacity;
}
};

Qcontainer::Qcontainer(int Qsize){
Qarr = new int[Qsize];
front = NULL;
rear = -1;
capacity = Qsize;
}

Qcontainer::~Qcontainer(){
delete [] Qarr;
}

int main(){
//create queue size 10
//enqueue 3 values
//dequeue 1 value
//show the front
//while queue is not empty
//show the front
//dequeue
//destroy queue
}