Process Scheduling


#1

Which of the following scheduling algorithms could result in starvation?
a. First Come First Serve
b. Shortest Job First
c. Round Robin
d. Priority


#2

Starvation is possible for option (b) & (d).

Reason:

Shortest Job First: If short processes are continuously added, it will require a long time to finish the job for longer processes that may lead to starvation.

Priority: If High Priority process are added again & again, low priority processes have to wait a long time to finish that may lead to starvation.


#3

Possible answer for this query is option b&d.


#4

B)in shortest job first ,short processes are taken places. So,longer processes have to wait a lot which causes starvation.
D)In priority,the processes which have higher priority are executed first and processes with lower priority have to wait a lot which causes starvation.