ll businesses want to keep their customers happy. To do that, many companies assign a certain amount of time to each customer to optimize the business. The alternative would be to hire more employees, which would lead to higher costs.This problem requires you to simulate how authorities optimize the number of cashiers at the entrance of a toll bridge to make sure drivers are satisfied. Make the following assumptions:There is one cashier per line. The line works as a queue with no cars cutting the line or leaving it.One car arrives at the entrance every 10 seconds.It takes 90 seconds (1.5 minutes) to process the payment, starting from the moment a cashier is available. Assume there is no pause between cars.Your Tasks:Design class CarInLine, with the following specifications:The class has two instance variables: arrivalTime and DepartureTime, stored as integers.Define a constructor that accepts an integer as an argument representing the arrival time, in which you set the departure time to zero, marking the beginning of a simulation.Create an appropriate set and get methods for the two instance variables.Implement a method totalTime() that returns an integer value representing the time spent in the queue, as the difference between the departure time and the arrival time.Define ten queues, simulating the functionality of the process, increasing the number of cashiers from one, and collecting the average waiting time for each scenario.Each simulation will work with the same number of cars, which is considered 100.The maximum number of cashiers/toll booths is 10.Create the queue with link-based implementation.Create each queue with the corresponding number of cashiers, from 1 to 10, and record the average processing time.Save the processing time in an array of integer values representing the processing time.At the end of the simulation, display the results in a table with the number of cashiers and the average waiting time, measured in seconds.Choose the optimum number of cashiers, considering that the desired wait time is 1.5 minutes (90 seconds)Display the result of your simulation, which is the optimum number of cashiers.If you implement all the required methods correctly, the driver program should generate outputs similar to the following:

Java is a programming language originally developed by James Gosling at Sun Microsystems (which is…

Answered: Design class CarInLine, with the…

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

ll businesses want to keep their customers happy. To do that, many companies assign a certain amount of time to each customer to optimize the business. The alternative would be to hire more employees, which would lead to higher costs.

This problem requires you to simulate how authorities optimize the number of cashiers at the entrance of a toll bridge to make sure drivers are satisfied. Make the following assumptions:

There is one cashier per line. The line works as a queue with no cars cutting the line or leaving it.
One car arrives at the entrance every 10 seconds.
It takes 90 seconds (1.5 minutes) to process the payment, starting from the moment a cashier is available. Assume there is no pause between cars.

Your Tasks:

Design class CarInLine, with the following specifications:
- The class has two instance variables: arrivalTime and DepartureTime, stored as integers.
- Define a constructor that accepts an integer as an argument representing the arrival time, in which you set the departure time to zero, marking the beginning of a simulation.
- Create an appropriate set and get methods for the two instance variables.
- Implement a method totalTime() that returns an integer value representing the time spent in the queue, as the difference between the departure time and the arrival time.
Define ten queues, simulating the functionality of the process, increasing the number of cashiers from one, and collecting the average waiting time for each scenario.
Each simulation will work with the same number of cars, which is considered 100.
The maximum number of cashiers/toll booths is 10.
Create the queue with link-based implementation.
Create each queue with the corresponding number of cashiers, from 1 to 10, and record the average processing time.
Save the processing time in an array of integer values representing the processing time.
At the end of the simulation, display the results in a table with the number of cashiers and the average waiting time, measured in seconds.
Choose the optimum number of cashiers, considering that the desired wait time is 1.5 minutes (90 seconds)
Display the result of your simulation, which is the optimum number of cashiers.
If you implement all the required methods correctly, the driver program should generate outputs similar to the following: