adplus-dvertising
frame-decoration

Question

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

a.

Shortest job first

b.

FCFS

c.

LCFS

d.

Round robin

Answer: (d).Round robin

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. Belady anomaly occurs in ?

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

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

Q. Dispatcher function is to

Q. Shortest Job First executes first the job

Q. Creating a job queue is a function of

Q. Poor response times are caused by

Q. Which is non pre-emptive

Q. Which module gives control of the CPU to the process selected by the short-term scheduler?

Q. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

Q. The interval from the time of submission of a process to the time of completion is termed as

Q. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

Q. In priority scheduling algorithm

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

Q. Time quantum is defined in

Q. Process are classified into different groups in

Q. In multilevel feedback scheduling algorithm

Q. CPU scheduling is the basis of ____________.

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

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