Assigned: 10 March 1999
Due: 17 March 1999 at 3:30 PM

Late homeworks will not be accepted.

1. Distinguish between long term and short term schedulers. What are the criteria that influence their design?
2. Consider the following processes:

   Process	Arrival time (ms)	Burst time (ms)
   P0	0	12
   P1	1	4
   P2	3	9
   P3	4	16
   P3	5	7

   1. Schedule the processes using FCFS, non-preemptive SJF, preemptive SJF, and round-robin (5 ms quantum). For each algorithm, show the Gantt chart for the schedule and list the average waiting time for the schedule.
      
   2. If these processes were using a multi-level feedback queue, where the first queue was round-robin with an 6 ms quantum, the second queue was round-robin with a 10 ms quantum, and the third queue was SJF, which queues would the processes end up in? Assume that the processes each run for enough bursts to end up in the proper queue. Would any processes move between queues even in steady state? Explain.
3. Problem 5.5 from the text.
4. Problem 5.8 from the text.