$1.$ Suppose that the following processes arrive for execution at the times indicated.

Each process will run for the amount of time listed. 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

P$10\mathrm{.}110$

P$20\mathrm{.}37$

P$30\mathrm{.}92$

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 P$1$ 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 P$1$ and P$2$ are waiting during this idle time, so their

waiting time may increase. This algorithm could be known as futureknowledge scheduling.