An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each event has a time stamp that denotes the time when the event will occur. The simulation program needs to efficiently perform the following two fundamental operations: • Insert an event with a given time stamp (that is, add a future event). • Extract the event with smallest time stamp (that is, determine the next event to process). The best data structure for this air-traffic control simulation is a priority queue. The priority queue will enable the handling of the time stamps and keep the events in order so that the event with the smallest time stamp is extracted easily. A. True B. False
An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each event has a time stamp that denotes the time when the event will occur. The simulation
• Insert an event with a given time stamp (that is, add a future event).
• Extract the event with smallest time stamp (that is, determine the next event to process).
The best data structure for this air-traffic control simulation is a priority queue. The priority queue will enable the handling of the time stamps and keep the events in order so that the event with the smallest time stamp is extracted easily.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps