Originally Posted by

**rock_win** Hi, this question is from Operating Systems By Galvin.

In this question according to solution manual I got the (a) part but for parts (b) & (c) I'm getting answers 6.86 and4.86 respectively and its not in the manual.

So , can someone help solving it.

6.4 Suppose that the following processes arrive for execution at the times indicated. Each

process will run the listed amount of time. In answering the questions, use nonpreemptive

scheduling and base all decisions on the information you have at the time the decision

must be made.

Process Arrival Time Burst Time

P1 0.0 8

P2 0.4 4

P3 1.0 1

a. What is the average turnaround time for these processes with the FCFS scheduling

algorithm?

b. What is the average turnaround time for these processes with the SJF scheduling algorithm?

c. The SJF algorithm is supposed to improve performance, but notice that we chose to

run process P1 at time 0 because we did not know that two shorter processes would

arrive soon. Compute what the average turnaround time will be if the CPU is left

idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1

and P2 are waiting during this idle time, so their waiting time may increase. This

algorithm could be known as future-knowledge scheduling.

Answer:

a. 10.53

b. 9.53

c. 6.86