C++ Multi-File Queue Exercise Hello Everyone and thank you in advance for your h

Question

C++ Multi-File 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

//adjust this program with your options

Program 1 for Menu

Program 2//

//this program will main enque and deque

// A C program to demonstrate linked list based implementation of queue
#include <stdlib.h>
#include <stdio.h>
static int size=0;
// A linked list (LL) node to store a queue entry
struct QNode
{
   int key;
   struct QNode *next;
};

// The queue, front stores the front node of LL and rear stores ths
// last node of LL
struct Queue
{
   struct QNode *front, *rear;
};

// A utility function to create a new linked list node.
struct QNode* newNode(int k)
{
   struct QNode *temp = (struct QNode*)malloc(sizeof(struct QNode));
   temp->key = k;
   temp->next = NULL;
   return temp;
}

// A utility function to create an empty queue
struct Queue *createQueue()
{
   struct Queue *q = (struct Queue*)malloc(sizeof(struct Queue));
   q->front = q->rear = NULL;
   return q;
}

// The function to add a key k to q
void enQueue(struct Queue *q, int k)
{
if(size<3){
   // Create a new LL node
   struct QNode *temp = newNode(k);

   // If queue is empty, then new node is front and rear both
   if (q->rear == NULL)
   {
   q->front = q->rear = temp;
   return;
   }

   // Add the new node at the end of queue and change rear
   q->rear->next = temp;
   q->rear = temp;
   }
   std::cout << "max capacity of 3 passangers reached";
}

// Function to remove a key from given queue q
struct QNode *deQueue(struct Queue *q)
{
   // If queue is empty, return NULL.
   if (q->front == NULL)
   return NULL;

   // Store previous front and move front one node ahead
   struct QNode *temp = q->front;
   q->front = q->front->next;

   // If front becomes NULL, then change rear also as NULL
   if (q->front == NULL)
   q->rear = NULL;
   return temp;
}

// Driver Program to test anove functions
int main()
{
   struct Queue *q = createQueue();
   enQueue(q, 10);
   enQueue(q, 20);
   deQueue(q);
   deQueue(q);
   enQueue(q, 30);
   enQueue(q, 40);
   enQueue(q, 50);
   struct QNode *n = deQueue(q);
   if (n != NULL)
   printf("Dequeued item is %d", n->key);
   return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.