Question 74

Computer Awareness I/O Management and CPU Scheduling Easy

Which CPU scheduling algorithm prefers the process with the shortest burst time?

(A) FCFS
(B) SJF
(C) Round Robin
(D) Priority Scheduling
View Dynamic Solution & Explanation
Correct Solution: Option B

Step-by-step Solution:

Explanation

CPU scheduling algorithms determine the order in which processes are executed. Here's a brief description of each option:

  • FCFS: Executes processes in the order they arrive. No consideration of burst time. Time complexity can lead to longer average waiting time.
  • SJF: Selects the process with the shortest CPU burst time next. This minimizes average waiting time.
  • Round Robin: Processes are executed in a cyclic order with a fixed time quantum. Burst time is not directly considered.
  • Priority Scheduling: Chooses the process with the highest priority, which may or may not be related to burst time.

Correct Answer: B. SJF (Shortest Job First)