In priority scheduling algorithm

Related MCQs

• An SJF algorithm is simply a priority algorithm where the priority 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
• Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
• With round robin scheduling algorithm in a time shared system                          
• Which is the most optimal scheduling algorithm?
• CPU scheduling is the basis of
• In the following cases non – preemptive scheduling occurs?
• Scheduling is done so as to                          
• Scheduling is done so as to
• Scheduling is done so as to