ISRO Computer Science (CSE) 2013 - Question 59

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2013

A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?

  • A. Priority queuing
  • B. Shortest job first
  • C. Youngest job first
  • D. Round robin

Answer: D. Round robin

Explanation: RR guarantees every process gets a slice, preventing starvation.

| | All questions of ISRO Computer Science (CSE) 2013