Skip to content

Operating Systems

Which scheduling algorithm always executes the process with the smallest burst time first?

Difficulty: Medium

About this MCQ

This Medium Operating Systems question asks: Which scheduling algorithm always executes the process with the smallest burst time first? The correct choice is B. Shortest Job First (SJF). Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.

Operating Systems items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Operating Systems so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.

Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Operating Systems item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.

Correct answer

B. Shortest Job First (SJF)

Explanation

Shortest Job First (SJF) is the term that matches “Which scheduling algorithm always executes the process with the smallest burst time first” (option B). Option A (Round Robin) does not fit this question. Option C (First Come First Served (FCFS)) does not fit this question. Option D (Priority Scheduling) does not fit this question. For this Operating Systems question, the accepted answer is Shortest Job First (SJF).

Source: Operating Systems Reference Guide

Tags: operating systems, scheduling, sjf

Submitted by: MCQsHub Editorial

Related MCQs

More Operating Systems MCQs