The BASHEMUP Parking Garage contains a single lane that holds up to six cars. Ca

Question

The BASHEMUP Parking Garage contains a single lane that holds up to six cars. Cars arrive at the south end of the garage and leave from the north end. If a customer arrives to pick up a car that is not the northernmost, all cars to the north of his car are moved out, his car is driven out, and the other cars are restored in the same order that they were in originally. Whenever a car leaves, all cars to the south are moved forward so that at all times all the empty spaces are in the south part of the garage. Write a program that reads a group of input lines. Each line contains an 'a' for arrival or a d' for departure and a license plate number. Cars are assumed to arrive and depart in the order specified by the input. The program should print a message each time that a car arrives or departs. When a car arrives, the message should specify whether or not there is room in the garage for the car. If there is no room for a car, the car then proceeds to the LOSEHUBCAP garage...which is similar to the BASHEMUP There is room for 6 cars at the LOOSEHUBCAP Garage. Now...if both garages are filled up, cars wait in the street near the BASHEMUP garage for a space..and of course they are queued up in the street as well. The street can hold only 6 cars. If more than 6 cars try to wait in the street the cars are told to go to BOSTON. So in summary...when a car arrives it tries to park in the BASHEMUP If no room it goes to the LOSEHUBCAP...If still no room it tries to park in the street When a car departs a message should indicate where it departed from (i.e. which garage or the street). If there is a car waiting to get in the garage (because both are full) then the first car in the street queue must be moved into the garage that now has room and a message stating this must appear. When a car exits either garage (but NOT the street) the parking fee must be also be displayed as follows: This will be a bit like buying a lottery ticket...your program should be able to generate a random number of either $0, $10, $20,$30 or $40...so some cars will pay nothing, and some will pay up to $40. C++ Help!!

Explanation / Answer

#include <iostream>
#include <fstream>
using namespace std;

void enter (int car);
void depart (int car, char choice);

const int maxqueue = 7;
class queue_type

{
public:
       void clear_queue();
       bool empty_queue();
       bool full_queue();
       void insert_queue(int car);
       void delete_queue(int& car);
       int queue[8];
       int front,rear;
};

queue_type bash, knock, street, temp;

int main()
{
   int car;
   char choice;
  
   bash.clear_queue();
   knock.clear_queue();
   street.clear_queue();
   temp.clear_queue();

   cout << "Enter an 'a' if your car is arriving or enter a 'd' if your car is departing. Enter q to quit: " << endl;
   cin >> choice;
   cout << "Enter license plate number: " << endl;
   cin >> car;
  
   while ((choice!='q')||(choice!='Q'))
   {
       if ((choice=='a')||(choice=='A'))
           enter (car);
       else if ((choice=='d')||(choice=='D'))
           depart (car, choice);
       cin >> choice;
       cin >> car;
   }
   return 0;
}

void enter(int car)
{
   if (!(bash.full_queue()))
   {  
       bash.insert_queue(car);
       cout << "Car " << car << " has been parked in the BASHEMUP parking garage. " << endl;
   }
   else if(!(knock.full_queue()))
   {  
       knock.insert_queue(car);
       cout << "BASHEMUP is full! Car " << car << " has been parked in the KNOCKEMDEAD parking garage. " << endl;
   }
   else if (!(street.full_queue()))
   {
       street.insert_queue(car);
       cout << "Both lots are full! Car " << car << " has been parked in the street until a spot opens up. " << endl;
   }
}

void depart(int car, char choice)
{
   int k=0, i=0, m;
   int c1[7], c2[7], c3[7];
   while(i<7)
   {
       c1[i]=1;
       c2[i]=1;
       c3[i]=1;
       i++;
   }
  
   while (!(bash.empty_queue()))
   {
       bash.delete_queue(car);
       if (choice != car)
       {
           if (k==0)
           {
               m=c1[i];
               m++;
               c1[i]=m;
               cout << "Car " << car << " departed and moved " << c1[i] << " times" << endl;
               i++;
               temp.insert_queue(car);
           }
       }
           else
           {
               cout << "Car Deleted" << endl;
               k=1;
           }
   }
   while (!(knock.empty_queue()))
   {
       knock.delete_queue(car);
       if (choice != car)
       {
           if (k==0)
           {
               m=c2[i];
               m++;
               c2[i]=m;
               cout << "Car " << car << " departed and moved " << c2[i] << " times" << endl;
               i++;
               temp.insert_queue(car);
           }
       }
           else
           {
               cout << "Car Deleted" << endl;
               k=1;
           }
   }
   while (!(street.empty_queue()))
   {
       street.delete_queue(car);
       if (choice != car)
       {
           if (k==0)
           {
               m=c3[i];
               m++;
               c3[i]=m;
               cout << "Car " << car << " departed and moved " << c3[i] << " times" << endl;
               i++;
               temp.insert_queue(car);
           }
       }
       else
           {
               cout << "Car Deleted" << endl;
               k=1;
           }
   }
}

void queue_type::clear_queue()
{
   front = maxqueue;
   rear = maxqueue;
}
bool queue_type::empty_queue()
{
   if (rear == front)
       return true;
   else
       return false;
}
bool queue_type::full_queue()
{
   int querear;
   if (rear == maxqueue)
       querear = 0;
   else
       querear = rear +1;
   if (querear == front)
       return true;
   else
       return false;
}

void queue_type::insert_queue(int car)
{
   if (rear == maxqueue)
       rear =0;
   else
       rear = rear + 1;
   car = queue[rear];
}

void queue_type::delete_queue(int& car)
{
   if (front == maxqueue)
       front = 0;
   else
       front = front + 1;
   car = queue[front];
}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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