Question

Which scheduling process is provably optimal?

priority scheduling
	round-robin scheduling
	shortest job first scheduling
	All of the above
	None of the above

Answer 1

Fourth option is the correct answer.

Priority scheduling process is provably optimal for non-preemptive scheduling.

Round-robin scheduling process is provably optimal for time shared environment.

Shortest job first scheduling process is provably optimal as it provides minimum average waiting time and maximum throughput for a given set of executable processes.

So, we can say all three given options are correct.

Fifth option is incorrect as the fourth option is true.

Please comment in case of any doubt.
Please upvote if this helps.