Computer Science · Operating Systems
Consider the following statements regarding the Shortest Remaining Time First (SRTF) scheduling algorithm: Statement 1: Shortest Remaining Time First (SRTF) is defined as the non-preemptive implementation of the Shortest Job First (SJF) scheduling policy. Statement 2: Under the SRTF discipline, a currently executing process will continue its execution until completion without being interrupted by newly arriving processes, regardless of their burst times. Which of the following is correct?
- 1Both statements are true.
- 2Both statements are false.✓
- 3Statement 1 is true, but Statement 2 is false.
- 4Statement 1 is false, but Statement 2 is true.
Correct answer
Both statements are false.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems