Question

Programming Assignment Description For this assignment, you will write a program that simulates people checking out at a grocery store. Your program will have people randomly arrive at the checkout line and spend a random amount of time checking out. Your program will keep track of the customers and the size of the queue. It will simulate several hours of service 1 minute at a time. Your program will randomly decide if a customer arrives each minute. It will randomly decide how much time they will need for checking out. It will then add them to the queue. It will then check the customer at the front of the queue to see if they have had enough time to actually check out. If so, it will remove them from the queue. Rules for the simulation: - Ask the user how many minutes the simulation should run for. - At the beginning of each iteration, decide whether or not a customer arrives. Assume a .25 probability that one will arrive each minute. When a customer does arrive, randomly assign them an amount of time needed to actually check out once they get to the front of the line. Assume this takes between 1 and 4 minutes. Put them in the the queue. -- At the end of each iteration, check to see if the person at the front of the line has had enough time to check out. If so, remove them from the queue. - Your program should display the progress of customers for every minute. -- The program should also keep a count of the number of customers served and the maximum queue size. Your program should use the queue type from the standard template library (STL)

C++

Sample run might look like this:

How many minutes should the simulation run? 10
Running simulation for 10 minutes.

minute 1: nothing happens
minute 2: customer 1 arrives and will need 3 minutes to check out
minute 3: nothing happens
minute 4: customer 2 arrives and will need 1 minute to check out
minute 5: customer 3 arrives and will need 1 minute to check out
minute 5: customer 1 has checked out
minute 6: customer 2 has checked out
minute 7: customer 4 arrives and will need 4 minutes to check out
minute 7: customer 3 has checked out
minute 8: nothing happens
minute 9: nothing happens

minute 10: nothing happens

The were 4 customers.
3 customers successfully checked out.
The maximum queue size was 2.

Your main program might start like this:

#include <iostream>

#include <queue>
#include <cstdlib>
#include <ctime>

using namespace std;

struct nodeType
{

int person;

    int timeNeeded;
}

int main() {

    queue<nodeType> checkoutLine;
    NodeType customer;

    srand(time(0));

...

Answer 1

Code in text form as well as screenshots of code and output are put below. Kindly rate if you find it helpful. Thanks.

#include <iostream>
#include <queue>
#include <cstdlib>
#include <ctime>

using namespace std;
struct nodeType
{
        int person;
        int timeNeeded;
};
 
 
 
int main() {
 
        queue<nodeType> checkoutLine;
        srand(time(0));
        int count = 1;  //count of no. of customers
 
        int time, max_queue_size = 0;
        int time_spent = 0;
        int total_checked = 0;
        cout << "How many minutes should the simulation run? : ";
        cin >> time;
        int happens;  //keep track of something happening every minute
        for (int i = 1; i <= time; i++) {
                happens = 0;
                int r = (rand() % 100) + 1;
                if (r > 75) {
                        nodeType *customer = new nodeType;    //allocate memory for a new nodeType
                        customer->person = count;
                        customer->timeNeeded = (rand() % 4) + 1;
                        cout << "minute " << i << ": Customer " << count << " arrives and will take " << customer->timeNeeded << " minutes to check out.\n";
                        checkoutLine.push(*customer);  //makes a copy of the allocated nodeType struct and pushes it into the queue.
                        free(customer);   //free memory temporarily allocated
                        count++;           //increment customer number.
                        happens = 1;
 
                }
 
                if (!checkoutLine.empty()) {
                        if (time_spent >= checkoutLine.front().timeNeeded) {
                                cout << "minute " << i << ": Customer "  << checkoutLine.front().person << " has checked out\n";
                                checkoutLine.pop();
                                total_checked++;
                                time_spent = 0;
                                happens = 1;
 
                        }
                        
                }
 
                if (!checkoutLine.empty()) 
                        time_spent++;
                
                if (happens == 0)   //if nothing happens print message
                        cout <<"minute "<< i<<": nothing happens\n";  
 
                if (checkoutLine.size() > max_queue_size) {
                        max_queue_size = checkoutLine.size();
                }
 
        }
 
        cout << "\nThere were " << count - 1 << " customers" << endl;
        cout << total_checked << " customers sucessfully checked out"<<endl;
        cout << "The maximum queue size was " << max_queue_size <<endl;
 
        
        
        return 0;
}

Code Screenshots

Iliue queue> #include <cstdlib> #include <ctime> using namespace std; Estruct node Type int person; int timeNeeded; Dint main() { queue<nodeType> checkoutline; srand(time()); int count = 1; //count of no. of customers int time, max_queue_size = 0; int time_spent = 0; int total_checked = 0; cout << "How many minutes should the simulation run? : ": cin >> time; int happens; //keep track of something happening every minute for (int i = 1; i <= time; i++) { happens = 0; int r = (rand() % 100) + 1; if (r > 75) { nodeType *customer = new nodeType; //allocate memory for a new node Type customer->person = count; customer->timeNeeded = (rand() % 4) + 1; cout << "minute " << i << ": Customer " «< count << " arrives and will take " << customer->timeNeeded << " minutes to check out.\n": checkoutLine.push(*customer); //makes a copy of the allocated node Type struct and pushes it into the r-stante « i« makes a copy

free(customer); count++; happens = 1; ULLS . LUPY OT the allocated node Type struct and pushes it into the queue. //free memory temporarily allocated //increment customer number. if (!checkoutline. empty()) { if (time_spent >= checkoutLine.front().timeNeeded) { cout << "minute " << i << ": Customer " << checkoutLine.front() .person << " has checked out\n"; checkoutLine.pop(); total_checked++; time_spent = 0; happens = 1; if (!checkoutline.empty()) time_spent++; if (happens == 0 //if nothing happens print message cout <<"minute "<< i<<": nothing happens\n"; if (checkoutline.size() > max_queue size) { max_queue_size = checkoutLine.size(); 63 64 65 66 cout << "\nThere were " << count - 1 << " customers" << endl; cout << total_checked << " customers sucessfully checked out"<<endl; cout << "The maximum queue size was " << max_queue_size <<endl; return 0;

Code output

How many minutes should the simulation run? : 40 minute 1: nothing happens minute 2: Customer 1 arrives and will take 2 minutes to check out. minute 3: nothing happens minute 4: Customer 2 arrives and will take 4 minutes to check out. minute 4: Customer 1 has checked out minute 5: Customer 3 arrives and will take 1 minutes to check out. minute 6: nothing happens minute 7: nothing happens minute 8: Customer 2 has checked out minute 9: Customer 3 has checked out minute 10: nothing happens minute 11: nothing happens minute 12: nothing happens minute 13: Customer 4 arrives and will take 1 minutes to check out. minute 14: Customer 4 has checked out minute 15: Customer 5 arrives and will take 2 minutes to check out. minute 16: nothing happens minute 17: Customer 5 has checked out minute 18: Customer 6 arrives and will take 2 minutes to check out. minute 19: nothing happens minute 20: Customer 6 has checked out, minute 21: nothing happens minute 22: nothing happens minute 23: nothing happens minute 24: nothing happens minute 25: nothing happens minute 26: Customer 7 arrives and will take 1 minutes to check out. minute 27: Customer 7 has checked out minute 28: nothing happens minute 29: Customer 8 arrives and will take 4 minutes to check out. minute 30: nothing happens minute 31: Customer 9 arrives and will take 1 minutes to check out. minute 32: nothing happens minute 33: Customer 8 has checked out minute 34: Customer 9 has checked out minute 35: nothing happens minute 36: nothing happens minute 37: nothing happens minute 38: nothing happens minute 39: nothing happens minute 40: nothing happens There were 9 customers 9 customers sucessfully checked out The maximum queue size was 2