Project 01: Landweber

[KingArthas]

[Programming Project] [Landweber] We want to simulate an airport
landing and takeoff pattern. The airport has three runways, runway 1,
runway 2, runway 3, there are four landing holding patterns, two for
each of the first two runways. Arriving planes will enter one of the
holding pattern queues, where the queues are to be as close in size as
possible. When plane enters a holding queue, it is assigned remain in
the queue before it must land (because of low fuel level.) There is
also a queue for takeoffs for each of the three runways. Plane
arriving in a takeoff queue are also assigned an integer id. The take
off queues should be kept approximately the same size.
At each time, up to three planes may arrive at the landing queues and
up to three planes may arrive at the takeoff queues. Each runway can
handle one takeoff or landing at each time slot. Runway 3 is to be
used for takeoffs except when a plane is low on fuel. At each time
unit, planes in either landing queue whose air time has reached zero
must be given priority over other landings and takeoffs. If only one
plane is in this category, runway 3 is to be used. If more than, then
the other runways are also used (at each time, at most three planes
can be serviced in this way.)
Use successive even (odd) integers for id’s of planes arriving at
takeoff (landing) queues at each time unit assume that arriving planes
are entered into queues before takeoffs or landing occur. Try to
design your algorithm so that neither landing nor takeoff queues grow
excessively. However arriving planes must be placed at the ends
queues. Queues cannot be reordered.
The output should clearly indicate what occurs at each time unit.
Periodically output (a) the contents of each queue; (b) the average
takeoff waiting time; (c) the average landing waiting time; (d) the
average flying time remaining on landing; and (e) the number of planes
landing with no fuel reserve. (b) and (c) are before planes that have
taken off or landed, respectively. The output should be self
explanatory and easy to understand (and uncluttered).
The input can be from a terminal, a file, or it can be generated by a
random number generator. For each time unit the input consists of the
number of planes arriving at take-off queues, the number of planes
arriving at landing queues, and the remaining flying times for each
plane arriving at a landing queue.

[Sara Ranjbaran]

salam , mamnun aqaye mostajab bekhatere proje

[Dfdhf Rt]

khahesh mikonam, vali ghol nemidam nomreye kamel begirid