Computer Science · Operating Systems
Which of the following scheduling algorithms is most prone to the convoy effect, where a long-running process blocks shorter processes behind it?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Round Robin
- 2Shortest Job First (SJF)
- 3Priority Scheduling (non-preemptive)
- 4First-Come, First-Served (FCFS)✓
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →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