In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

Related MCQs

• If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.
• In priority scheduling algorithm
• Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
• In multilevel feedback scheduling algorithm
• What is the ready state of a process?
• The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
• Which one of the following is the deadlock avoidance algorithm?
• What is the drawback of banker’s algorithm?
• In operating system, each process has its own
• In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :