Q1. Explain Multilevel Feedback Queue Scheduling.
Ans. Before multilevel feedback scheduling algorithm, we used only multilevel scheduling algorithm which was not so flexible, but this one uses separate queue for handling the processes, it automatically adjust the priority of the process. If the priority is high and the process will be allotted to lower priority queue, then automatically it can switch to the higher priority queue.
One queue may implement round robin algorithm the other may use first come fir serve algorithm, the allocation is based on the type of process, and that is, the process is either of CPU bound to I/O bound etc.
This type of scheduling allows the process to move between the various queues. The idea is to implement aging. The process that takes too much CPU time is assigned with lower priority queues, in addition to the process that waits too long for processing and is assigned to higher priority queues.