Computer Science · Operating Systems
Which of the following is an example of a strictly non-preemptive CPU scheduling algorithm?
- 1First-Come, First-Served (FCFS)✓
- 2Round Robin (RR)
- 3Shortest Remaining Time First (SRTF)
- 4Priority-based Preemptive Scheduling
Correct answer
First-Come, First-Served (FCFS)
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