adplus-dvertising
frame-decoration

Question

In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.

a.

Shortest Remaining Time Next (SRTN) Scheduling

b.

Priority Based Preemptive Scheduling

c.

Round Robin Scheduling

d.

None of the above

Answer: (c).Round Robin Scheduling

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably....

Similar Questions

Discover Related MCQs

Q. In the multi-programming environment, the main memory consisting of _________ number of process.

Q. CPU Scheduling is the basis of _________ operating system.

Q. ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.

Q. Saving the state of the old process and loading the saved state of the new process is called ________.

Q. Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 : 1 : 5 , P5 : 5 : 2.

Q. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.

Q. The degree of Multiprogramming is controlled by

Q. Round robin scheduling is essentially the preemptive version of ________.

Q. In the blocked state

Q. The number of processes completed per unit time is known as __________.

Q. _________ is the situation in which a process is waiting on another process,which is also waiting on another process, which is waiting on the first process. None of the processes involved in this circular wait are making progress.

Q. FIFO scheduling is ________.

Q. The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________ .

Q. Which scheduler controls the degree of multi programming?

Q. A scheduling algorithm is fair

Q. What is a long-term scheduler ?

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

Q. What is a medium-term scheduler ?

Q. What is a short-term scheduler ?

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