Solved

In Priority Scheduling Algorithm, When a Process Arrives at the Ready

Question 10

Multiple Choice

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

A) all process
B) currently running process
C) parent process
D) init process

Related Questions

Q5: The only state transition that is initiated

Q6: If all processes I/O bound, the ready

Q7: The primary distinction between the short term

Q8: Which of the following need not necessarily

Q9: the access takes place, is called a(n)

Q11: Which of the following does not interrupt

Q12: The processes that are residing in main

Q13: An unrecoverable error is known as _.<br>A)hard

Q14: What is a medium-term scheduler ?<br>A)it selects

Q15: What is a short-term scheduler ?<br>A)it selects