adplus-dvertising
frame-decoration

Question

Round-robin scheduling

a.

allows interactive tasks quicker access to the processor

b.

is quite complex to implement

c.

gives each task the same chance at the processor

d.

allows processor-bound tasks more time in the processor

Answer: (c).gives each task the same chance at the processor

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Round-robin scheduling

Similar Questions

Discover Related MCQs

Q. What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?

Q. Scheduling is

Q. The SJF algorithm executes first the job

Q. The dispatcher

Q. Seeks analysis

Q. The CPU, after receiving an interrupt from an I/O device

Q. The FIFO algorithm

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

Q. Special software to create a job queue is called a

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

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

Q. Throughput of a system is

Q. In process scheduling, ………………… determines which ready process will be executed next by processor.

Q. In process scheduling, …………………… determines when new processes are admitted to the system.

Q. Match the following mechanisms for interrupting the execution of a process and their uses.

i) Interrupt a) Call to an operating system function
ii) Trap b) Reaction to an asynchronous external event
iii) Supervisor Call c) Handling of a error or an exception condition

Q. Following is/are the reasons for process suspension.

Q. State which statement is true for Suspended process?

i) The process is not immediately available for execution.
ii) The process may be removed from suspended state automatically without removal order.

Q. Which of the following are the states of a five state process model?

i) Running ii) Ready iii) New iv) Exit v) Destroy

Q. .............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes.

Q. ___________ is a technique of improving the priority of process waiting in Queue for CPU allocation.