Question

Give the following scheduling algorithms : STRF, SJF, RR(q=6)

Process	Arrival Time	Burst Time	Priority
P0	2	15	3
P1	4	20	2
P2	0	28	1
P3	8	14	3

Answer 1

1. SRTF :

Process	Arrival Time	BurstTime	Completion Time
P0	2	$\cancel{15} 0$	17
P1	4	$\cancel{20} 0$	51
P2	0	$\cancel{28} \cancel{26}0$	77
P3	8	и0	31

SRTF stands for Shortest Remaining Time First is a preemptive scheduling algorithm where when a process with a less burst time arrives, then the running process is preempted and new arrived process is given a chance to run on CPU.

Let's see how the process execute.

P2	P0	P3	P1	P2
0	2	17	31	51 - 77

This is how the process is scheduled. P2 will be preempted in between.

2. SJF :

2) SJF (Non-Preemptive) Process Arrival Time Burst Time Completion Time iso 2 57 Po 4 200 77 Pi 2%. P2 28 42 P3 8 14. o Pa P3 Po 28 42 57 77 o

3) RR (TQ=6) Burst Time completion Process Arrival Time Time 57 2 Po 184% 2046820 Pi 4 73 P2 O 38 ye y61646 71 P3 8 14400 71 Ready Queue: la Queue: Ja, 8o, l./h, e. pl. h. Pf. 3.4.& Pallo Pi P₂ P₂ Po Pilla | P₂ P. P. 1 P₂ P P. P. o 6 12 18 24 30 36 42 48 54 57 63 69 71 73 77

If you have any questions comment down and please? upvote thanks