https://uadoc.uacdn.net/doubts/DPLQ08TLVB/1636515655LUJ8LDT5.JPEG

hacademy
End practice
ng System
Question 8
2
3
4
5.
Consider following process scenario:
Process
Arrival Time
Burst Time
7
8
9
10
P1
0
25ns
2
13
14
15
P2
0
73ns
P3
0
8ns
18
19
20
P4
0
175
P5
0
30ns
23
24
25
28
29
30
First come first serve (FCFS), non-preemptive shortest job first (SJF) and round robin (RR)
with quantum =25ns; scheduling algorithms are implemented on the above process
scenario independently. Which of the following is/are true regarding the average waiting
time observed by various algorithms?
7
TS
1
Saved
Next question
0
ENG
IN
0 0
02:40 PM
10-11-2021
s


English

Educator solution

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Doubt solution

Doubt details

CS & IT

AUTO-GENERATED

Solutions available

Educator solution