Question

5. Which option below describes the multi-level feedback-queue scheduling method.

(a) Process move between multiple ready queues. The scheduler keeps analyzing the behavior (e.g., time of execution) of processes and according to which the scheduler changes the processes’ priority.

(b) The ready queue is divided into separate queues for each class of processes.

(c) Every process has some tickets and scheduler picks a random ticket and the process

having that ticket is the winner and it is executed for a time slice and then another

ticket is picked by the scheduler.

(d) Each process is assigned a priority. A process with the highest priority is executed first.Processes with the same priority are executed on first come first served basis.

Answer 1

Hi, I would love to answer this question for you. I hope you would love an answer and get a clear idea related to the same. So not wasting much time let's get started.

(a) Process move between multiple ready queues. The scheduler keeps analyzing the behavior (e.g., time of execution) of processes and according to which the scheduler changes the processes’ priority.

This is the correct statement for the Multilevel Feedback queue scheduling method. After this, the highest priority processes are solved and if left it is transferred into less priority than that for further execution.

I hope you like the answer and got a clear idea related to the same.

Please give thumbs up to an answer and do comment for any queries

Thanks and Happy to Help :)

HAPPY LEARNING