Driver class CarInLine: import java.io.*; class CarInLine{ static int ctr=0; static int cars,cash; static int DepartureTime=0; static int arrivalTime=0; static int ctr_tax=0; CarInLine(){ ctr++; cars=0; cash=0; } void pcar(){ System.out.print(“\nEnter the amount of toll:”); cash=cash+cash; cars++; } void npcar(){ cars++; } void disp(){ System.out.print(” \n\Number of cashiers\n\n”); System.out.print(“\tAverage time\n\n”); System.out.print(“\Optimum number of cashiers is"); } } void tax(int a){ if(a==1) ctr_tax++; } } class booth{ public static void main(String arg[]){ DataInputStream ins=new DataInputStream(System.in); int ans=1,ncar=5; do{ CarInLine c=new car(); try{ System.out.print("Press 1 if u want to pay tax "); ans=Integer.parseInt(ins.readLine()); c.tax(ans); System.out.print("Another car? Press 5 "); ncar=Integer.parseInt(ins.readLine()); } catch(IOException e){ } } while(ncar==5); System.out.println("Average Procesing time: "+car.ctr); int non = car.ctr - car.ctr_tax; System.out.println("No. of cars which have not paid tax: "+non); int amt = car.ctr_tax*50; System.out.println("Amount of cash collected: "+amt); } } 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
Driver class CarInLine: import java.io.*; class CarInLine{ static int ctr=0; static int cars,cash; static int DepartureTime=0; static int arrivalTime=0; static int ctr_tax=0; CarInLine(){ ctr++; cars=0; cash=0; } void pcar(){ System.out.print(“\nEnter the amount of toll:”); cash=cash+cash; cars++; } void npcar(){ cars++; } void disp(){ System.out.print(” \n\Number of cashiers\n\n”); System.out.print(“\tAverage time\n\n”); System.out.print(“\Optimum number of cashiers is"); } } void tax(int a){ if(a==1) ctr_tax++; } } class booth{ public static void main(String arg[]){ DataInputStream ins=new DataInputStream(System.in); int ans=1,ncar=5; do{ CarInLine c=new car(); try{ System.out.print("Press 1 if u want to pay tax "); ans=Integer.parseInt(ins.readLine()); c.tax(ans); System.out.print("Another car? Press 5 "); ncar=Integer.parseInt(ins.readLine()); } catch(IOException e){ } } while(ncar==5); System.out.println("Average Procesing time: "+car.ctr); int non = car.ctr - car.ctr_tax; System.out.println("No. of cars which have not paid tax: "+non); int amt = car.ctr_tax*50; System.out.println("Amount of cash collected: "+amt); } } 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
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Written in java,
Your Tasks:
- Driver class CarInLine:
- import java.io.*;
class CarInLine{
static int ctr=0;
static int cars,cash;
static int DepartureTime=0;
static int arrivalTime=0;
static int ctr_tax=0;
CarInLine(){
ctr++;
cars=0;
cash=0;
}
void pcar(){
System.out.print(“\nEnter the amount of toll:”);
cash=cash+cash;
cars++;
}
void npcar(){
cars++;
}
void disp(){
System.out.print(” \n\Number of cashiers\n\n”);
System.out.print(“\tAverage time\n\n”);
System.out.print(“\Optimum number of cashiers is");
}
}
void tax(int a){
if(a==1)
ctr_tax++;
}
}
class booth{
public static void main(String arg[]){
DataInputStream ins=new DataInputStream(System.in);
int ans=1,ncar=5;
do{
CarInLine c=new car();
try{
System.out.print("Press 1 if u want to pay tax ");
ans=Integer.parseInt(ins.readLine());
c.tax(ans);
System.out.print("Another car? Press 5 ");
ncar=Integer.parseInt(ins.readLine());
}
catch(IOException e){
}
}
while(ncar==5);
System.out.println("Average Procesing time: "+car.ctr);
int non = car.ctr - car.ctr_tax;
System.out.println("No. of cars which have not paid tax: "+non);
int amt = car.ctr_tax*50;
System.out.println("Amount of cash collected: "+amt);
}
}
- import java.io.*;
- 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:
![Number of cashiers:
Average time:
Optimum number of cashiers is: 9
Average processing time: 90
Press any key to continue..
1
2
3
4
5
6
7
9
10
4050
1805
1060
690
470
325
223
147
90
90](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb99975d4-dab4-4a50-a0df-a77956d37934%2Fbc99e3df-905f-4104-8d75-8dcca69d8a8b%2F5ccx1hy_processed.png&w=3840&q=75)
Transcribed Image Text:Number of cashiers:
Average time:
Optimum number of cashiers is: 9
Average processing time: 90
Press any key to continue..
1
2
3
4
5
6
7
9
10
4050
1805
1060
690
470
325
223
147
90
90
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education