Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities everyT time units and decides the next process to schedule. Which one of the following is TRUE if theprocesses have no I/O operations and all arrive at time zero?
One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
A scheduling algorithm can use either ___________ priority or ________ priority.
An SJF algorithm is simply a priority algorithm where the priority is ____________
In this figure, 3 types of scheduling using preemptive scheduling policies is shown. Which of the following options is correctly referring to each of these scheduling types?
The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.
Which scheduling algorithm is an optimal scheduling policy for mono-processor system?