Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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?
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
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 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?
SSTF algorithm, like SJF __________ of some requests.
The SJF algorithm executes first the job
The real difficulty with SJF in short term scheduling is ____________
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called __________
A scheduling algorithm can use either ___________ priority or ________ priority.
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.