operating systems

Exercises: Chapter 5 -Scheduling algorithms Exercise 1 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. 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? Exercise 2 Consider the set of 5 processes whose arrival time and burst time are given below- If the CPU scheduling policy is SJF pre-emptive, calculate the average waiting time and average tumaround time. Consider the set of 6 processes whose arrival time and burst time are given below- If the CPU scheduling policy is shortest remaining time first, calculate the average waiting time and average turnaround time. Exercises: Chapter 5 -Scheduling algorithms Exercise 1 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. 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? Exercise 2 Consider the set of 5 processes whose arrival time and burst time are given below- If the CPU scheduling policy is SJF pre-emptive, calculate the average waiting time and average tumaround time. Consider the set of 6 processes whose arrival time and burst time are given below- If the CPU scheduling policy is shortest remaining time first, calculate the average waiting time and average turnaround time