Operating Systems · Question 1 · Easy
Which CPU scheduling algorithm is most prone to the convoy effect, where short processes wait behind one long process?
- Round Robin
- First-Come, First-Served (FCFS)
- Shortest Remaining Time First
- Priority scheduling with aging
Answer and explanation
Answer: B. First-Come, First-Served (FCFS)
Explanation: In FCFS, one long CPU-bound process at the head of the queue makes every short process behind it wait. This is the convoy effect.
Next: A process that has issued an I/O request and cannot continue until the I/O…
Practise operating systems
Try a fresh set of operating systems questions with an explanation after every answer, free and without signing up: Operating Systems practice. Or sit a full placement mock test.
More operating systems questions
- A process that has issued an I/O request and cannot continue until the I/O…
- What is thrashing in an operating system?
- Which of the following is NOT one of the four necessary conditions for a…
- Where does the operating system save a process's program counter, CPU…
- Three processes arrive at time 0 in the order P1, P2, P3 with CPU burst times…
- Process (arrival time, burst time) in ms: P1 (0, 8), P2 (1, 4), P3 (2, 2), P4…
- A system has 3 page frames, all initially empty. For the page reference string…
- A counting semaphore S is initialised to 8. Then 11 wait (P) operations and 5…
- How many times is "Hi" printed when this C program runs? Assume every fork()…
- In which memory-management scheme does internal fragmentation occur?
More technical & programming practice
Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming · Java · Python
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge