adplus-dvertising
frame-decoration

Question

Scheduling is done so as to :

a.

increase CPU utilization

b.

decrease CPU utilization

c.

keep the CPU more idle

d.

None of these

Answer: (a).increase CPU utilization

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Scheduling is done so as to :

Similar Questions

Discover Related MCQs

Q. Turnaround time is :

Q. Scheduling is done so as to:

Q. Waiting time is :

Q. Response time is :

Q. Te purpose of CPU Scheduling is:

Q. Round robin scheduling falls under the category of :

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

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

Q. Complex scheduling algorithms :

Q. The FIFO algorithm :

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

Q. CPU Scheduling is :

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 ?

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

Q. Which of the following statements are true ?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time

Q. The most optimal scheduling algorithm is :

Q. The real difficulty with SJF in short term scheduling is :

Q. The FCFS algorithm is particularly troublesome for ____________.

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3

i) Assuming the above process being scheduled with the SJF scheduling algorithm :

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm :