C++ Queue Exercise Hello Everyone and thank you in advance for your help. Please
ID: 3776969 • Letter: C
Question
C++ Queue Exercise
Hello Everyone and thank you in advance for your help. Please my question below.
**************Purpose of this Program:**************
-This program is supposed to maintain two queue lists for an airline both with a max capacity of 3 passangers. There is a booked list and a waiting list. If both lists are full and the usertries to add another pasanger the yshould get a warning message saying the list is full. Please see my sample Output below for how this program should work.
**************What i Need help with:**************
-writing the main cpp file to finish this, finishing the header file. Ive put notes in each below after "//"
*********What i am supposed ot have:**********
-a header file(queue file below) and a Main CPP file.
*************Header File:**************
const int MAX = ??; //Not sure what this needs to be
struct Passenger {
char name[80];
};
class CQueue {
private:
int front;
int rear;
Passenger passengers[MAX];
public:
CQueue();
bool IsEmpty(void);
bool IsFull(void);
void Enqueue(Passenger);
Passenger Front(void);
void Dequeue(void);
};
**************Current Main CPP File:**************
#include
#include
#include "cqueue.h"
using namespace std;
enum choice { BOOKED, WAITING };
const int LINES = 2;
int showMenu(void);
void addPassenger(CQueue*);
void deletePassenger(CQueue*);
void showPassengers(CQueue*);
int main (void)
{
CQueue qPassengers[LINES];
int x;
do{
x = showMenu();
switch (x)
{
case 1: addPassenger(qPassengers);
break;
case 2: deletePassenger(qPassengers);
break;
case 3: showPassengers(qPassengers);
break;
}
} while (x != 4);
return 0;
}
int showMenu(void)
{
int select;
cout << "Menu ";
cout << "======== ";
cout << "1. Add Passenger ";
cout << "2. Delete Passenger ";
cout << "3. Show Passengers ";
cout << "4. Exit ";
cout << "Enter choice: ";
cin >> select;
return select;
}
// To do: implement addPassenger, deletePassenger and showPassengers
**************Sample Output**************
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
No passengers
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 2
No passengers to delete
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Jeff
Booking Jeff on flight
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
Booked Passengers
=================
Jeff
No passengers on waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Mikhail
Booking Mikhail on flight
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Ivan
Booking Ivan on flight
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
Booked Passengers
=================
Jeff
Mikhail
Ivan
No passengers on waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Waiter
Sorry. Plane fully booked. Adding Waiter to waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
Booked Passengers
=================
Jeff
Mikhail
Ivan
Waiting list
=================
Waiter
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 2
Removing Jeff from booked passengers
Adding Waiter from waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
Booked Passengers
=================
Mikhail
Ivan
Waiter
No passengers on waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Fred
Sorry. Plane fully booked. Adding Fred to waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Dead
Sorry. Plane fully booked. Adding Dead to waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Enter name: Foodita
Sorry. Plane fully booked. Adding Foodita to waiting list
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 3
Booked Passengers
=================
Mikhail
Ivan
Waiter
Waiting list
=================
Fred
Dead
Foodita
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 1
Sorry. Plane and waiting list fully booked. Try later
Menu
========
1. Add Passenger
2. Delete Passenger
3. Show Passengers
4. Exit
Enter choice: 4
Press any key to continue
Explanation / Answer
main.cpp
#include <iostream>
#include <string>
#include "cqueue.h"
using namespace std;
enum choice { BOOKED, WAITING };
const int LINES = 2;
int showMenu(void);
void addPassenger(CQueue*);
void deletePassenger(CQueue*);
void showPassengers(CQueue*);
int main(void)
{
CQueue qPassengers[LINES];
int x;
do {
x = showMenu();
switch (x)
{
case 1:
addPassenger(qPassengers);
break;
case 2:
deletePassenger(qPassengers);
break;
case 3:
showPassengers(qPassengers);
break;
}
} while (x != 4);
return 0;
}
int showMenu(void)
{
int select;
cout << "Menu ";
cout << "======== ";
cout << "1. Add Passenger ";
cout << "2. Delete Passenger ";
cout << "3. Show Passengers ";
cout << "4. Exit ";
cout << "Enter choice: ";
cin >> select;
return select;
}
void addPassenger(CQueue* queue){
Passenger passenger;
if (!queue[BOOKED].IsFull()){
cout << "Enter name: ";
cin >> passenger.name;
cout << "Booking " << passenger.name << " on flight ";
queue[BOOKED].Enqueue(passenger);
}
else if (queue[BOOKED].IsFull() && !queue[WAITING].IsFull()){
cout << "Enter name: ";
cin >> passenger.name;
cout << "Sorry. Plane fully booked. Adding " << passenger.name << " to waiting list ";
queue[WAITING].Enqueue(passenger);
}
else if (queue[BOOKED].IsFull() && queue[WAITING].IsFull()){
cout << "Sorry. Plane and waiting list fully booked. Try later ";
}
}
void deletePassenger(CQueue* queue){
if (queue[BOOKED].IsEmpty()){
cout << "No passengers to delete ";
}
else if (!queue[BOOKED].IsEmpty() && queue[WAITING].IsEmpty()){
cout << "Removing " << queue[BOOKED].Front().name << " from booked passengers ";
queue[BOOKED].Dequeue();
}
else if (queue[BOOKED].IsFull() && !queue[WAITING].IsEmpty()){
cout << "Removing " << queue[BOOKED].Front().name << " from booked passengers ";
queue[BOOKED].Dequeue();
cout << "Adding " << queue[WAITING].Front().name << " from waiting list ";
queue[BOOKED].Enqueue(queue[WAITING].Front());
queue[WAITING].Dequeue();
}
}
void showPassengers(CQueue* queue){
if (queue[BOOKED].IsEmpty()){
cout << "No passengers ";
}
else if (!queue[BOOKED].IsEmpty() && queue[WAITING].IsEmpty()){
cout << "Booked Passengers " << "================= ";
string startingName = queue[BOOKED].Front().name;
do {
cout << queue[BOOKED].Front().name << endl;
Passenger placeholder = queue[BOOKED].Front();
queue[BOOKED].Dequeue();
queue[BOOKED].Enqueue(placeholder);
} while (queue[BOOKED].Front().name != startingName);
cout << "No passengers on waiting list ";
}
else if (!queue[BOOKED].IsEmpty() && !queue[WAITING].IsEmpty()){
cout << "Booked Passengers " << "================= ";
string startingName = queue[BOOKED].Front().name;
do {
cout << queue[BOOKED].Front().name << endl;
Passenger placeholder = queue[BOOKED].Front();
queue[BOOKED].Dequeue();
queue[BOOKED].Enqueue(placeholder);
} while (queue[BOOKED].Front().name != startingName);
cout << "Waiting list " << "================= ";
startingName = queue[WAITING].Front().name;
do {
cout << queue[WAITING].Front().name << endl;
Passenger placeholder = queue[WAITING].Front();
queue[WAITING].Dequeue();
queue[WAITING].Enqueue(placeholder);
} while (queue[WAITING].Front().name != startingName);
}
}
cqueue.cpp
using namespace std;
#include"cqueue.h"
CQueue::CQueue(){
front = MAX - 1;
rear = MAX - 1;
for (int i = 0; i < MAX; i++){
for (int j = 0; j < 80; j++){
passengers[i].name[j] = ' ';
}
}
}
bool CQueue::IsEmpty(void){
bool empty;
if (front == rear)
empty = true;
else
empty = false;
return empty;
}
bool CQueue::IsFull(void){
bool full;
if ((rear + 1) % MAX == front)
full = true;
else
full = false;
return full;
}
void CQueue::Enqueue(Passenger p){
rear = (rear + 1) % MAX;
passengers[rear] = p;
}
Passenger CQueue::Front(void){
Passenger frontP = passengers[(front + 1) % MAX];
return frontP;
}
void CQueue::Dequeue(void){
front = (front + 1) % MAX;
}
cqueue.h
const int MAX = 4; //To do: determine appropriate number
struct Passenger {
char name[80];
};
class CQueue {
private:
int front;
int rear;
Passenger passengers[MAX];
public:
CQueue();
bool IsEmpty(void);
bool IsFull(void);
void Enqueue(Passenger);
Passenger Front(void);
void Dequeue(void);
};
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.