Which CPU scheduling algorithm prefers the process with the shortest burst time?
Show Hint
- FCFS
- SJF
- Round Robin
- Priority Scheduling
The Correct Option is B
Solution and Explanation
Step 1: Definition of SJF.
SJF (Shortest Job First) is a non-preemptive CPU scheduling algorithm that selects the process with the shortest burst time for execution next. It minimizes the average waiting time.
Step 2: Analysis of other options.
- (1) FCFS: First Come First Serve executes processes in the order of their arrival, not based on burst time.
- (3) Round Robin: This algorithm assigns fixed time slices to processes, regardless of their burst time.
- (4) Priority Scheduling: Processes are scheduled based on their priority, not burst time.
Step 3: Conclusion.
The correct answer is **SJF**, which prefers the process with the shortest burst time.
Top Questions on CPU Scheduling
- Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{FCFS} & (III)\ \text{Often long average waiting time} \\ \hline (B)\ \text{Round Robin} & (I)\ \text{FCFS + preemption} \\ \hline (C)\ \text{Multi-level queue scheduling} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (II)\ \text{Allows the processes to move between queues} \\ \hline \end{array}\] Choose the correct answer from the options given below:- CUET (PG) - 2025
- Computer Science
- CPU Scheduling
- Which of the following scheduler/schedulers is/are also called CPU scheduler?
(A) Short Term Scheduler
(B) Long Term Scheduler
(C) Medium Term Scheduler
(D) Asymmetric Scheduler
Choose the correct answer from the options given below:- CUET (PG) - 2025
- Computer Science
- CPU Scheduling
- Processes \( P_1, P_2, P_3, P_4 \) arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times. Which ONE of the following correctly gives the average turnaround time of the four processes in milliseconds?
- GATE CS - 2025
- Operating System
- CPU Scheduling
Questions Asked in CUET PG exam
- Which of the following is not the application of Divide and Conquer technique?
- CUET (PG) - 2025
- Algorithms
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
- CUET (PG) - 2025
- Pointers and Arrays
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.
- CUET (PG) - 2025
- Scheduling Algorithms