Which of the following scheduling algorithms is optimal in terms of minimizing the average waiting time for a given set of stationary processes?

Question

Physics · Computer Science

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

Shortest Job First (SJF) scheduling

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Computer Science?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Physics · Computer Science

The arrival of which commission in India triggered widespread protests, including mass hartals across the country in 1928?

Which of the following leaders was instrumental in initiating and leading India’s struggle for independence?

Which of the following viceroys of India is associated with the 'Ilbert Bill' controversy?

Answer 1

Priority-based scheduling

Answer 2

Shortest Job First (SJF) scheduling

Answer 3

Round Robin (RR) scheduling

Answer 4

First-Come, First-Served (FCFS) scheduling

Related Practice Questions