• Given the jobs are served on first-come, first-served (FCFS) basis, while programming the above event-driven simulation, you must:

  1. Explain how the system handles conflicts when jobs are put into a waiting queue, and there are jobs still entering the system. Which job goes first?
  2. Explain how the system handles the "job clocks," which keep track of the amount of time each job has run, and the "wait clocks," which keep track of how long each job in the waiting queue has to wait.
  3. Explain how you define an "event", since this is an event-driven system, and what happens in your system when the event occurs.
  4. Examine the results from the best-fit run and compare them with the results from the first-fit run:
     1. Explain what the results indicate about the performance of the system for this job mix and memory organization.
     2. Is one method of partitioning better than the other? Why or why not?
     3. Could you recommend one method over the other given your sample run? Would this hold in all possible cases?
     4. Write some conclusions and recommendations.