This is a queue code that has to be written in c++. I am having some troubles writing it. Please help NORMAL82DAYTONCOLUMBUS190OUTPUTThe first part of your output should consist of a series of messages. Each time a plane lands, amessageshould be printed along with all the flight information and whether the landing was anemergency or not. Each time a plane is added to a queue, a message should be printed along withall the flight information and which queue the plane was added to. Finally, every time throughthe main read loop, you should print a message stating what "time cycle" it is.The second part of your output should consist of a list of all flights still in the two queues at theend of the simulation.DATA STRUCTURESYou will need two array-based queues one for normal flights and one for emergencies. Queuesshould be manipulated directly-functions should be used to handle them. Do not accessvariables globally. Do not use pointers, standard libraries, or classes.Make the runway variable an enumerated user-defined data type, i.e., let it have (BUSY,CLEAR) as its possible values. All flight information should be set up in a record. Use onlynamed data types. You are to write a program to simulate the landing of airplanes at a small airport. The airport hasone runway. Your main read loop should repeat the following tasks: get a request, put the planeinto a queue; allow one plane to land if the runway is available (clear).A new request is read at the beginning of each "time cycle." For your purposes, a time cycle willbe equivalent to one trip through your main read loop. Planes requesting clearance to land are putin a normal queue. Planes that have some kind of problem and must land immediately are put ina priority queue.A plane is allowed to land every other time cycle. When a plane lands, its flight information isprinted out.When all the data has been processed, the contents of the two queues are printed out withappropriate headers.МЕТНODThe top level of this program should look like:set queues to emptyset runway to clearset time to zeroreadloop until no more dataincrement timecheck the request; then add to the proper queuecheck the runway; if clear then land a plane & set runwayto busy else set runway to clearreadend looptraverse & print contents of queues

The C++ program is written according to the simulation of the landing airplanes in the small airport. The queue function is written and it is user driven program program where it takes the input from the user Necessary comments are provided in the program and sample output of the program is attached. #include<iostream>#include <iomanip>#include <math.h>#include <queue>using namespace std; //to check if the plane going to queuestatic boolifPlaneComingIntorunwayQueue(int avgInterval){ double drand = rand() / (double) RAND_MAX; if (drand < (1.0 / avgInterval)) return true; else return false; } // to check if plane crashedstatic boolif_PlaneCrashed(int in, int out, int interval){ if (out - in > interval) { return true; } else { return false; } } intmain(){ cout << " The amount of time needed for one plane to land: " << endl; int land_Time; //the amount of time needed for a plane to land (in minutes) cin >> land_Time; cout << " The amount of time needed for one plane to take off: " << endl; int take_offTime; //the amount of time needed for a plane to takeoff (in minutes) cin >> take_offTime; cout << " The average amount of time between arrival of planes to the landing queue: " << endl; int avg_ArrivalInterval; //the average amount of time between landing cin >> avg_ArrivalInterval; cout << " The average amount of time between arrival of planes to the takeoff queue: " << endl; int avg_DepartureInterval; //the average amount of time between takeoff cin >> avg_DepartureInterval; cout << " The maximum amount of time that a plane can stay in the landing queue without running out of fuel and crashing: " << endl; int stayinqueue; //the amount of time an airplane can stay in the air before running out of fuel cin >> stayinqueue; cout << " The total length of time to be simulated: " << endl; int total_Time; //the total amount of time the simulation will run (in minutes) cin >> total_Time; int totalTimeSpentInLandingQueue = 0, totalTimeSpentInTakeoffQueue = 0; int N_PlanesLanded = 0; //number of planes that requested landing int N_PlanesTookoff = 0; //number of planes that requested takeoff int N_PlanesCrashed = 0; //number of planes that crashed queue < int >landingQueue; // to put landing planes in queue queue < int >takeoffQueue; // to put takeoff planes in queue for (int i = 0; i < total_Time; ++i) { cout << "Top of loop t=" << i << '\n'; if (ifPlaneComingIntorunwayQueue(avg_ArrivalInterval)) { cout << "Plane arrives on landing queue\n"; landingQueue.push(i); } if (ifPlaneComingIntorunwayQueue(avg_DepartureInterval)) { cout << "Plane arrives on takeoff queue\n"; takeoffQueue.push(i); } while (true) { while (!landingQueue.empty() && if_PlaneCrashed(landingQueue.back(), i, stayinqueue)) { int nextPlane = landingQueue.front(); landingQueue.pop(); N_PlanesCrashed++; cout << "Landing plane that arrives at " << nextPlane << " has crashed.\n"; } if (!landingQueue.empty()) { int nextPlane = landingQueue.front(); landingQueue.pop(); N_PlanesLanded++; cout << "Landed plane that arrived at " << nextPlane << '\n'; totalTimeSpentInLandingQueue += (i - nextPlane); int j; for (j = i; j < land_Time + i && j < total_Time; ++j) { if (ifPlaneComingIntorunwayQueue(avg_ArrivalInterval)) { cout << j << ": Plane arrives on landing queue\n"; landingQueue.push(j); } if (ifPlaneComingIntorunwayQueue(avg_DepartureInterval)) { cout << j << ": Plane arrives on takeoff queue\n"; takeoffQueue.push(j); } } i = j; if (i >= total_Time) { break; } } else { break; } } if (!takeoffQueue.empty()) { int nextPlane = takeoffQueue.front(); cout << "Launching plane that arrived at " << nextPlane << '\n'; takeoffQueue.pop(); N_PlanesTookoff++; totalTimeSpentInTakeoffQueue += (i - nextPlane); int j; for (j = i; j < take_offTime + i && j < total_Time; ++j) { if (ifPlaneComingIntorunwayQueue(avg_ArrivalInterval)) { cout << j << ": Plane arrives on landing queue\n"; landingQueue.push(j); } if (ifPlaneComingIntorunwayQueue(avg_DepartureInterval)) { cout << j << ": Plane arrives on takeoff queue\n"; takeoffQueue.push(j); } } i = j; } } cout << "End time reached\n"; while (!landingQueue.empty() && if_PlaneCrashed(landingQueue.back(), total_Time, stayinqueue)) { int nextPlane = landingQueue.front(); cout << "Landing plane that arrives at " << nextPlane << " has crashed.\n"; landingQueue.pop(); N_PlanesCrashed++; } cout << "The number of planes that took off in the simulated time is " << N_PlanesTookoff << endl; cout << "the number of planes that landed in the simulated time is " << N_PlanesLanded << endl; cout << "the number of planes that crashed because they ran out of fuel before they could land is " << N_PlanesCrashed << endl; cout << "the average time that a plane spent in the takeoff queue is " << totalTimeSpentInTakeoffQueue / (double) N_PlanesTookoff << endl; cout << "the average time that a plane spent in the landing queue is " << totalTimeSpentInLandingQueue / (double) N_PlanesLanded << endl; system("pause"); return 0;}Sample output:

Engineering

Computer Engineering

You are to write a program to simulate the landing of airplanes at a small airport. The airport has one runway. Your main read loop should repeat the following tasks: get a request, put the plane into a queue; allow one plane to land if the runway is available (clear). A new request is read at the beginning of each "time cycle." For your purposes, a time cycle will be equivalent to one trip through your main read loop. Planes requesting clearance to land are put in a normal queue. Planes that have some kind of problem and must land immediately are put in a priority queue. A plane is allowed to land every other time cycle. When a plane lands, its flight information is printed out. When all the data has been processed, the contents of the two queues are printed out with appropriate headers.

You are to write a program to simulate the landing of airplanes at a small airport. The airport has one runway. Your main read loop should repeat the following tasks: get a request, put the plane into a queue; allow one plane to land if the runway is available (clear). A new request is read at the beginning of each "time cycle." For your purposes, a time cycle will be equivalent to one trip through your main read loop. Planes requesting clearance to land are put in a normal queue. Planes that have some kind of problem and must land immediately are put in a priority queue. A plane is allowed to land every other time cycle. When a plane lands, its flight information is printed out. When all the data has been processed, the contents of the two queues are printed out with appropriate headers.

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

Similar questions

Q. Difference between Stack and Queue Data Structures. Write down key differences. Write some code snippets. Draw images with some examples. Show differences for operations like push/pop, add/remove, etc.
need help on this. Thanks in advance!
Write a C++ program that implements a linked list as an abstract data type. The program must: Be type flexible, that is, could be a list of integers, string, or any type. allow the user to add members into the list delete members from the list make sure the list is still sorted after all the deletion and addition Show all the function implementation.
Create a program in C++ using a character linked list. It will insert the letters into the list alphabetically. Ask the user to enter a word. Then, enter the word into the list. Then, print out what is in the list, and clear it out. example: enters: apple prints: aelpp You can do this by writing your own linked list (extra credit), or using the STL list class. -- if you are using the STL list class, do not use the “sort” function.
Given integers 2,15,17,12,5. Write a program that prints the maximum of these 5 numbers using priority queue data structure in C++.
In C++ language. Please look at the instructions and help with program. This is for intermediate not advanced. so help me understand please
With the help of a high-level language, write a program to execute the push operations in stack and in queue. Insert appropriate comments to explain the program to a novice indicating how the program executes.
In c++ please
In c++ and please without the use of vectors. Thanks very much! A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use linear search. Modify the algorithm to output the count of how many comparisons were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Joe 123-5432 Linda 983-4123…
4. In C++, write a program to input a string and show how can you reverse the string using a queue data structure. Reverse the original string and do not declare any other string variable in the program.
Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++. Please explain with detailed. Thank you!
Please help with C++Priority Queue question in C++ language. Sample output also in image. Thanks.