Question 22Asked in UGC NET Computer Science, June 2017 (Paper II & III, Selected Questions)

Which of the following scheduling algorithms may cause starvation?

Which of the following scheduling algorithms may cause starvation? A. First-come-first-served B. Round Robin C. Priority D. Shortest process next E. Shortest remaining time first
  1. AA, C and E
  2. BC, D and E
  3. CB, D, and E
  4. DB, C and D
Show answerHide answer

Correct answer: (B) C, D and E

Explanation

(1) First come – first served – No starvation (2) Round robin – No starvation (3) Priority – starvation if higher priority process called again & again lower priority starves (4) Shortest process next = starvation possible (5) Shortest remaining time first = starvation possible

From UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions)

This is question 22 of UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.