Discussion
In multilevel feedback scheduling algorithm
Answer: A
In multilevel feedback scheduling, a process can move to a different classified ready queue.
The multilevel feedback queue scheduler keeps several ready queues of different priorities. A process that uses too much CPU time is moved to a lower-priority queue, and one that waits too long can be moved up (ageing). This movement, the 'feedback', is what distinguishes it.
In the plain multilevel queue algorithm, by contrast, processes are classified once and the classification is permanent. Processes are classified into groups in both, so the other options are wrong.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development