Homework answers / question archive / Data Structures and Algorithms Objective: To practice writing an application program that uses the ADT of the FIFO queue structure to simulate a real system, so that the system’s behavior can be predicted

Data Structures and Algorithms Objective: To practice writing an application program that uses the ADT of the FIFO queue structure to simulate a real system, so that the system’s behavior can be predicted

Computer Science

Share With

---

Data Structures and Algorithms

Objective: To practice writing an application program that uses the ADT of the FIFO queue structure to simulate a real system, so that the system’s behavior can be predicted.

What to do:

Extend the simulation of the airport application that was given to you earlier, by asking the user to enter the number of runways that the simulated airport should use. The user shall be able to specify a positive integer number, up to five, of runways in the airport (i.e. 1, 2, 3 … or 5), and a real number to represent the percentage (0 to 100) of relative priority the airport management is giving to landing flights over takeoff flights (for example: if the entered percentage is 66.67, it means that for every three time units, one flight takes-off and two flights land). Any time the concerned queue is empty its turn goes to the other queue.

Suppose that we fix the following parameters:

1. Set the maximum size for the landing and takeoff queues to 10 for all runs.

2. Set the simulation to run for 10000 time units for all runs.

3. Set the percentage of relative queue priority to 50 for all runs.

Run the simulator a sufficient number of runs with different values for the rest of the input parameters (number of runways, and the expected numbers of the arrivals and departures) for each run, to find out what is the minimum number of runways that can sustain what maximum expected number of arrivals and departures, so that the runways utilizations are not less than 50%, and no more than 80%, and the waiting times for planes never exceed 0.5 time units.

Start with the case of one runway, and repeat for each additional runway, until you reach the maximum (5), and report your findings supported by a listing of the following statistical data for each case (five cases):

- The number of runways.

- The total number of time units of the run.

- The maximum allowed queue length.

- The percentage of relative queue priority.

- The maximum expected number of arrivals.

- The maximum expected number of departures.

- The total number of airplanes processed.

- The number of departed airplanes.

- The number of arrived airplanes.

- The number of airplanes refused service.

- The number of airplanes left ready to land.

- The number of airplanes left ready to takeoff.

- The percentage of time each runway was idle (between 20% and 50%).

- The average length of the arrivals queue.

- The average length of the departures queue.

- The average waiting time to land (no more than 0.5).

- The average waiting time to takeoff (no more than 0.5).

What to turn in:

- Your program source .java files.

- The results from all five simulation runs, proving your findings, in one .pdf file.

- Submit one .zip file containing all the above files.