6.5.1 Discrete Event Simulation

Priority queues provide a natural dats structure to use in event list maintenance in discrete event simulations. The objective of this assignment is to develop event list algorithms using priority queues and use these as a component in a discrete event simulation package. Singly linked lists are commonly used in implementing event lists. One can use binary heaps and binomial queues for better performance.

Write a simulation package for a discrete event system (with a large number of events) and compare the performance of naive linked lists, binary heaps, and binomial queues in event list related aspects of the simulation.