TIFR CSE 2020 | Part B | Question: 8

Question

Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs may keep running indefinitely. A $\textsf{starvation free}$ job-scheduling policy guarantees that no job waits indefinitely for service. Which of the following job-scheduling policies is starvation free?

• A. Round – robin
• B. Shortest job first
• C. Priority queuing
• D. Latest job first
• E. None of the others

Comments

The round-robin (RR) scheduling algorithm is similar to FCFS scheduling, but preemption is added to enable the system to switch between processes. A small unit of time, called a time quantum or time slice, is defined.

Round robin is free from starvation and gives a fair allocation to every process.

So, the correct answer is $(A).$

Answer 1

Option A) is correct

---

• Shortest Job First: Starvation for Longer Jobs

• Priority Queuing: Starvation for Lower Priority Jobs

• Latest Job First: Starvation for Older Jobs

• Round Robin: No starvation

Answer 2

Round robin is starvation free.

starvation means some processes are not getting the resources for a longer period because schduling algorithm does not allow these processes into. Roun robin is a time sharing system with some time quantum with elapsation of which other job will be executed. Hence no starvation arises in round robin.Hence the option (A) is correct.

Answer 3

• SJF: Starvation for Longer Jobs

• Priority Queuing: Starvation for Lower Priority Jobs

• LJF: Starvation for Older Jobs

• RR: No starvation
• FCFS-No starvation

Comments

how fcfs no starvation..what if the first come process have longer BT then another process continue wating...so fcfs have starvation na