DFL airport has a single runway which is used exclusively to land airplanes. Airplanes that wish to land form a queue (a moving queue) in which airplanes join the end of a straight line stretching in the back of the runway. The airplane in front of the line is the next airplane scheduled to land. Such a line can stretch to a length of over 50 miles.

An airplane can land only if it is the first one in line, there is no other airplane in front of him in the line, and all airplanes that have landed have cleared the runway.

The arrival process of airplanes to DFL airport has a Poisson distribution with an intensity of one plane per two minutes. The arrival rate does not change during the operational hours, with the airport operating sixteen hours per day.

The service time of a plane during the landing process (the time from the moment it becomes the first in line, until it frees the runway) has a distribution with a mean of 1.75 minutes and a standard deviation of 2.

Answer the following questions:
A. What is the expected queue length of planes waiting to land (including the one which is landing)?

B. How much time does it take on the average from the moment a plane joins the queue until it lands and clears the runway?

C. Estimating that the per hour cost of keeping an airplane in the air and on the runway is $8,000. What is the cost per day of all airplanes in the queue and on the runway (combined)?

D. Given that the cost per day of all airplanes in the queue and on the runway is $200,000, what is the arrival rate that generates such costs? Hint, use goal seeking to find the rate. Use a cost of $8,000 per plane per hour.

E. DFL management forecasts a significant increase in the number of landings in DFL. They have to decide when to build a second runway used exclusively for landings, and when to add a third runway dedicated to landings. They estimate that a landing runway costs $200,000 per day (amortization over its lifetime, financing, maintenance, security,...). They also estimate that one hour of a plane in the air and on the runway costs $8,000.

Implement the following specification for an integer function in the client program that returns the number of items in a queue. The queue is unchanged.
int GetLength(QueType queue)
Function: Determines the number of items in the queue.
Precondition: queue has been initialized.
Postconditions: queue is unchanged.
Functio

Using only the algorithms in the queue and stack ADT's, write an algorithm called reverseQueue that copies the contents of a queue to another queue, and reverses the order of the data. After data is copied, the data that is at the front of Q1, should be at the rear of Q2.

1. Suppose there is a program that reads a word and writes the reverse of the word to to output. For example, the program reads "faced" and writes "decaf". The program uses a stack to reverse the string. Please list all activation of the push and pop methods along with which letter is being pushed or popped at each step if the i

Write the definition of the function template moveNthFront that takes as a parameter a queue and a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose queue = {5, 11, 34, 67, 43, 55} and n = 3.
After a call to the fun

2. Suppose that queue is a queueType object and the size of the array implementing queue is 100. Also suppose that the value of queueFront is 99 and the value of queueRear is 25.
a. What are the values of queueFront and queueRear after adding an element to queue?
b. What are the values of queueFront and queueRear after rem

Consider the following statements:
stackType stack;
queueType queue;
int x;
Suppose the input is:
15 28 14 22 64 35 19 32 7 11 13 30 -999
Show what is output by the following segment of code.
stack.initializeStack();
queue.initializeQueue();
stack.push(0);
queue.addQueue(0);
cin>>x;
while(x != -99

List the elements in the queue after each of the following operations:
queue intQueue;
intQueue.push(18);
intQueue.push(2);
intQueue.push(intQueue.front());
intQueue.push(intQueue.front());
intQueue.pop();
Please provide a complete program if it makes sense.

Using a single-server queuing system with Poisson arrivals of 10 units per hour and a constant service time of 2 minutes per unit. How do I go about calculating how long the customer waiting time will be in seconds, on average?

See attached excel spreadsheet (example) for queing simulation.
I need help to put the info from problem #1 into Excel.
1.) First American Bank is trying to determine whether it should install one or two drive-thru teller windows. The following probability distribution for arrival intervals and service times have been dev

(a) Consider a coffee counter with a single server at which tired students arrive according to a Poisson process. Let the mean arrival rate be two students per ten minutes and assume the serving time is exponentially distributed with an average of 180 seconds per student.
1. What is the average queue length?
2. How long does