...
Question 11508 – APPSC-2012-DL CA
March 27, 2024
Question 11512 – APPSC-2012-DL CA
March 27, 2024
Question 11508 – APPSC-2012-DL CA
March 27, 2024
Question 11512 – APPSC-2012-DL CA
March 27, 2024

Question 11511 – APPSC-2012-DL CA

Which scheduling algorithm from the following is allows processes to move from one queue (different classified queues based on scheduling parameters) to another?

Correct Answer: D

Question 41 Explanation: 
Multilevel feedback queue scheduling solves the problem of starvation of low priority processes in multilevel scheduling and in this the processes can move from one queue to another.
A
Multilevel Queue Scheduling
B
Priority Based Scheduling
C
Round Robin Scheduling
D
Multilevel Feedback Queue Scheduling

Leave a Reply

Your email address will not be published. Required fields are marked *