Q. A scheduling algorithm is fair

View solution

Q. What is a long-term scheduler ?

View solution

Q. If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.

View solution

Q. What is a medium-term scheduler ?

View solution

Q. What is a short-term scheduler ?

View solution

Q. The primary distinction between the short term scheduler and the long term scheduler is :

View solution

Q. The only state transition that is initiated by the user process itself is :

View solution

Q. 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 :

View solution

Q. In a multi-programming environment :

View solution

Q. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :

View solution

Q. The context of a process in the PCB of a process does not contain :

View solution

Q. Which of the following need not necessarily be saved on a context switch between processes ?

View solution

Q. Which of the following does not interrupt a running process ?

View solution

Q. Which of the following state transitions is not possible ?

View solution

Q. Which of following is not an advantage of multiprogramming ?

View solution

Q. Spooling is most beneficial where

View solution

Q. Which scheduling policy is most suitable for time shared operating system ?

View solution

Q. Belady anomaly occurs in ?

View solution

Q. Which among following scheduling algorithms give minimum average waiting time

View solution

Q. In which scheduling policies, context switching never takes place

View solution