Q. An I/O bound program will typically have :

View solution

Q. A process is selected from the ______ queue by the ________ scheduler, to be executed.

View solution

Q. In the following cases non – preemptive scheduling occurs :

View solution

Q. The switching of the CPU from one process or thread to another is called :

View solution

Q. Dispatch latency is :

View solution

Q. Scheduling is done so as to :

View solution

Q. Turnaround time is :

View solution

Q. Scheduling is done so as to:

View solution

Q. Waiting time is :

View solution

Q. Response time is :

View solution

Q. Te purpose of CPU Scheduling is:

View solution

Q. Round robin scheduling falls under the category of :

View solution

Q. With round robin scheduling algorithm in a time shared system,

View solution

Q. The portion of the process scheduler in an operating system that dispatches processes is concerned with :

View solution

Q. Complex scheduling algorithms :

View solution

Q. The FIFO algorithm :

View solution

Q. The strategy of making processes that are logically runnable to be temporarily suspended is called :

View solution

Q. CPU Scheduling is :

View solution

Q. There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms ?

View solution

Q. Which of the following algorithms tends to minimize the process flow time ?

View solution