schedulingalgorithmdeterminesanorderfortheexecutionofitsscheduled processes. Given
processes to be scheduled on one proces-sor, how many possible different schedules are there? Give a formula interms of
Deﬁne the difference between preemptive and nonpreemptive schedul-ing.
Suppose that the following processes arrive for execution at the timesindicated.Each processwillrunthe listedamount of time.Inansweringthe questions, use nonpreemptive scheduling and base all decisions onthe information you have at the time the decision must be made.Process Arrival Time Burst Time
1.0 1a. What is the average turnaround time for these processes with the
scheduling algorithm? b. What is the average turnaround time for these processes with the
scheduling algorithm?c. The
attime0becausewedidnotknowthat two shorter processes would arrive soon. Compute what theaverageturnaroundtimewillbeifthe
arewaitingduringthisidletime,sotheirwaitingtimemayincrease. This algorithm could be known as future-knowledgescheduling.