Which of the following statements is not true for Multi Level Feedback Queue…
2015
Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm ?
- A.
Queues have different priorities
- B.
Each queue may have different scheduling algorithm
- C.
Processes are permanently assigned to a queue
- D.
This algorithm can be configured to match a specific system under design
Attempted by 517 students.
Show answer & explanation
Correct answer: C
Answer: Processes are permanently assigned to a queue is not true for the Multi Level Feedback Queue algorithm.
Explanation:
Multiple priority queues: MLFQ maintains several ready queues with different priority levels; higher-priority queues are served before lower-priority ones.
Dynamic movement between queues: A process can be promoted or demoted between queues based on its CPU usage and waiting time. For example, a process that uses its full time quantum may be demoted to a lower-priority queue, while a process that waits too long can be promoted to prevent starvation (aging).
Configurable behavior: The number of queues, time quanta, promotion/demotion rules, and per-queue scheduling policies can be tuned to match system needs.
Conclusion: Because processes are moved between queues according to observed behavior and aging policies, they are not permanently assigned to a single queue.
Example: An interactive process that frequently yields the CPU will remain in higher-priority queues, while a CPU-bound process that exhausts its quanta will be pushed to lower-priority queues over time.
A video solution is available for this question — log in and enroll to watch it.