Find the total waiting time using SJF without pre-emption scheduling.
| Process | Arrival time | CPU burst time |
| p1 | 0 | 5 |
| p2 | 2 | 4 |
| p3 | 1 | 6 |
| p4 | 3 | 3 |
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- WT = waiting time, AWT = average waiting time, AT = arrival time Consider the following set of processes, t...
- An operating system uses shortest remaining time first (SRT) process scheduling algorithm. Consider the arr...
- How many context switches are required for SRJF scheduling for the given processes? | | || |---|---|---| |P...
- Consider the following set of processes, with the arrival time and the CPU-burst time given in milliseconds...
- Consider the following set of processes, with the arrival time and the CPU-burst time given in milliseconds...
- Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arri...
- An operating system uses shortest remaining time first (SRT) process scheduling algorithm. Consider the arr...
- Turnaround time = completion time – arrival time. Average turnaround time = Total turnaround time/total pro...