The purposes of this assignment are to practice implementing simulations using the DES algorithm, and to explore implementations of the event list as a priority queue.
Problem #1 (40 points): Do Problem 1.15 from the text. Use the parameters specified in Problem 1.14 in the text.
#1.1 (30 points): Run the simulation for 10 replications. In addition to the usual output statistics, provide as output at the end of each replication the average number in transit and the maximum number in transit.
#1.2 (10 points): What is the required length of the event list data structure? Explain.
Problem #2 (50 points)
#2.1 (30 points): Redo Problem #1 implementing the event list as a dynamic data structure.
#2.2 (10 points): Discuss the advantages and the disadvantages of the dynamic implementation.
#2.3 (10 points): Discuss the theoretical efficiency of your data structure and why you may choose it.
Problem #3 (10 points) Describe how the Splay tree implementation works, as well as its complexity.
Submission instructions:
Place all your files into a folder, make that folder a zipped file, and submit that zipped file via Canvas. Your files should have the following: (1) all the source codes; (2) a PDF file that is the output report summarizing output from each replication of the program; (3) any written responses requested in the problems; (4) the instructions and commands about how to compile your codes, run your program, and re -produce your results. Note that please use “gcc” as your complier, and please compile your codes in command-line windows, instead of IDEs.
Grading:
You will be graded on (1) completing all the parts of the assignment, (2) correctly applying the methods and techniques, (3) having the content make sense, and (4) the quality of your writing—communicating ideas clearly, concisely, completely, and correctly (spelling and grammar). Programs and mathematical computations will be graded according to their correctness. In addition, programs will be graded on the quality of the programming (documentation, modularity, etc.) If you cannot get your program to run perfectly, please turn it in for partial credits.
