Question: Which of the following Statement is TRUE for Shortest-Job-First Scheduling <ol> <li>The SJF algorithm is a special case of the general priority-scheduling algorithm</li> <li>it can be implemented at the level of short-term CPU scheduling</li> <li>A nonpreemptive SJF algorithm will allow the currently running process to finish its CPU burst</li> <li>A preemptive SJF algorithm will preempt the currently executing process</li> </ol>
Answer:
The Disadvantages of SJF algorithm is it cannot be implemented at the level of short-term CPU scheduling
MCQ: Which of the following Statement is TRUE for Shortest-Job-First Scheduling <ol> <li>The SJF algorithm is a special case of the general priority-scheduling algorithm</li> <li>it can be implemented at the level of short-term CPU scheduling</li> <li>A nonpreemptive SJF algorithm will allow the currently running process to finish its CPU burst</li> <li>A preemptive SJF algorithm will preempt the currently executing process</li> </ol>
Correct Answer:
A. 1 ,2,4
Explanation:
The Disadvantages of SJF algorithm is it cannot be implemented at the level of short-term CPU scheduling
Discuss a Question
Related Questions
- 1. Which of the following Statement is TRUE for First-Come, First-Served Scheduling <ol> <li>When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue</li> <li>FCFS scheduling algorithm is preemptive</li> <li>The implementation of the FCFS policy is easily managed with a FIFO queue</li> <li>the average waiting time under the FCFS policy is often quite small</li> </ol>
- 2. The next CPU burst of the newly arrived process may be shorter than what is left of the currently executing process. A _____ will preempt the currently executing process
- 3. The ____ is a special case of the general priority-scheduling algorithm
- 4. In which of the following Scheduling Algorithm A priority is associated with each process, and the CPU is allocated to the process with the highest priority.
- 5. In Priority Scheduling Equal-priority processes are scheduled in ___ order
- 6. In Priority Scheduling Algorithm Which of the following stands True
- 7. The Priority Scheduling algorithm can be
- 8. A preemptive priority scheduling algorithm will preempt the CPU if
- 9. A nonpreemptive priority scheduling algorithm will simply put the new process at ___
- 10. The indefinite blocking, or starvation is A major problem related to which of the following scheduling algorithm
You may be interested in:
OS CPU scheduling MCQsRecently Added Articles
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar
