COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a process can move to a different classified ready queue
|
|
|
classification of ready queue is permanent
|
|
|
processes are not classified into groups
|
|
|
NONE
|
Detailed explanation-1: -The multilevel feedback-queue scheduling algorithm, in contrast, allows a process to move between queues. The idea is to separate processes according to the characteristics of their CPU bursts. If a process uses too much CPU time, it will be moved to a lower-priority queue.
Detailed explanation-2: -MFQS is a flexible scheduling algorithm. It allows the different processes to move between queues.
Detailed explanation-3: -Multilevel Feedback Scheduling It is a distinct process with a distinct CPU burst time. It enables a process to switch between queues.
Detailed explanation-4: -A multi-level queue scheduling algorithm partitions the ready queue into several separate queues. The processes are permanently assigned to one queue, generally based on some property of the process, such as memory size, process priority, or process type. Each queue has its own scheduling algorithm.