Suppose that the following processes arrive for execution at the time…
Previous year question for Operating Systems.
Question
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed : 10+10
| 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 trunaround time for these processes with the SJF scheduling algorithm?
- Year: 2018
- Subject: Operating Systems
Related pages
More PYQs on Scheduling Algorithms
- Consider a system with a set of processes P1, P2, P3 and their CPU burst times, priorities and arrival times being mentioned as below: Process | CPU burst time…
- Given the following information: Process | Arrival Time | Burst time | Priority --- | --- | --- | --- A | 0 | 3 | 3 B | 1 | 6 | 5 C | 2 | 1 | 2 D | 3 | 4 | 1 E…
- What is starvation and convoy effect and in which of the scheduling algorithms these can occur?
- Explain the difference between Preemptive Shortest job first and Non preemptive shortest job first scheduling algorithms with an example.