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
✓ Correct Answer: Option B Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

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)

Practice Similar I/O Management and CPU Scheduling Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2025:

Q33 Which disk scheduling algorithm looks for the track closest to the current...
Solve →
Q47 Match List-I with List-II. |c|l| List-I (CPU Scheduling Algorithm) &...
Solve →
Q55 Which of the following scheduler/schedulers is/are also called CPU...
Solve →
Q1 Match List-I with List-II |c|l| List-I & List-II \\ (A)\ Seek Time & (I)\...
Solve →
Q4 In case of Binary search tree which of the following procedure's running...
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →