Log In
1 vote

Which of the following scheduling algorithms could result in starvation?

  1. Priority
  2. Round Robin
  3. FCFS
  4. None of the above
in Operating System
edited by

3 Answers

0 votes
Priority scheduling algorithm could result starvation. Starvation is nothing but indefinite blocking.

Hence, correct option is A.
0 votes
Priority scheduling can result in starvation. Suppose we have 5 processes of low priority, all of which have arrived at time 0 and however, at time 1, high priority processes keep on arriving. So the low priority processes will be postponed indefinitely hence causing starvation.

FCFS, Round Robin scheduling can never result in starvation.
0 votes
starvation in scheduling algorithm occurs when any process is favoured over other.

since FCFS and RR doesnt favour any process therfore they are starvation priority based scheduling more priority process gets favoured over low priority hence Ans: A

Related questions

2 votes
2 answers
Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is $11$ $12$ $13$ $14$
asked Apr 1 in Operating System Lakshman Patel RJIT 211 views
0 votes
1 answer
Which two are valid constructions for Thread? Thread(Runnable r, String name) Thread() Thread(int priority) Thread(Runnable r, ThreadGroup g) Thread(Runnable r, int priority) $1$ and $3$ $2$ and $4$ $1$ and $2$ $2$ and $5$
asked Apr 1 in Operating System Lakshman Patel RJIT 184 views
1 vote
2 answers
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
asked Apr 1 in Operating System Lakshman Patel RJIT 199 views
0 votes
1 answer
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is $\text{S-R}$ Flip-flop with inputs $X = R$ and $Y=S$ $\text{S-R}$ Flip-flop with inputs $X = S$ and $Y=R$ $\text{J-K}$ Flip-flop with inputs $X = J$ and $Y=K$ $\text{J-K}$ Flip-flop with inputs $X = K$ and $Y=J$
asked Aug 28 in Digital Logic Lakshman Patel RJIT 449 views