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>
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
5 Best Amazon Advertising Agencies for Growing Brands
Last updated on: November 6, 2026Posted by: ExamRadar
How Image to Text Conversion Make Printed Study Materials Easier to Use?
Last updated on: October 23, 2026Posted by: ExamRadar
7 Best Online Exam Makers for Teachers, Schools, and Businesses
Last updated on: October 21, 2026Posted by: ExamRadar
How to pick a Bintan resort when you’ve only got 48 hours
Last updated on: September 23, 2026Posted by: ExamRadar
Features to Look for While Choosing the Best Automation Tool
Last updated on: July 15, 2026Posted by: ExamRadar
How Do Java Development Teams Use Docker and Kubernetes to Deploy Applications?
Last updated on: April 24, 2026Posted by: ExamRadar
AI vs Machine Learning: Key Differences Every Professional Should Know
Last updated on: February 13, 2026Posted by: ExamRadar