adplus-dvertising
frame-decoration

Question

A scheduling algorithm is fair

a.

if no process faces starvation

b.

if a process is starved, detect it and run it with high priority

c.

if it uses semaphores

d.

only if a queue is used for scheduling

Posted under Operating System

Answer: (a).if no process faces starvation

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A scheduling algorithm is fair

Similar Questions

Discover Related MCQs

Q. What is a long-term scheduler ?

Q. If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.

Q. What is a medium-term scheduler ?

Q. What is a short-term scheduler ?

Q. The primary distinction between the short term scheduler and the long term scheduler is :

Q. The only state transition that is initiated by the user process itself is :

Q. In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :

Q. In a multi-programming environment :

Q. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :

Q. The context of a process in the PCB of a process does not contain :

Q. Which of the following need not necessarily be saved on a context switch between processes ?

Q. Which of the following does not interrupt a running process ?

Q. Which of the following state transitions is not possible ?

Q. Which of following is not an advantage of multiprogramming ?

Q. Spooling is most beneficial where

Q. Which scheduling policy is most suitable for time shared operating system ?

Q. Belady anomaly occurs in ?

Q. Which among following scheduling algorithms give minimum average waiting time

Q. In which scheduling policies, context switching never takes place

Q. Dispatcher function is to