Question

consider three cpu intensive processes p1, p2, p3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. suppose operating system is implementing shortest remaining time first (pre-emptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of ready queue and at the end of ready queue are not counted). (a) 3 (b) 2 (c) 4 (d) 5

Answer 1

Hlo...

HERE IS UR ANSWER...

A) 3

HOPE IT'S HELP YOU...

THANKS☺️☺️☺️

Answer 2

Hello!!

consider three cpu intensive processes p1, p2, p3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. suppose operating system is implementing shortest remaining time first (pre-emptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of ready queue and at the end of ready queue are not counted).

Answer=option A

3✔️✔️✔️