Unit -2

CPU Scheduling

Q.. Round robin scheduling falls under the category of :

a) Non preemptive scheduling
b) Preemptive scheduling
c) All of the mentioned
d) None of the mentioned

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

a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm

Q. The portion of the process scheduler in an operating system that dispatches processes is
concerned with :
a) assigning ready processes to CPU
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
d) all of the mentioned

Q. The FIFO algorithm :

a) first executes the job that came in last in the queue
b) first executes the job that came in first in the queue
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs

Q. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned

Q. The interval from the time of submission of a process to the time of completion is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput

Q. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
compared with the priority of
a) all process
b) currently running process
c) parent process
d) init process
Q. In multilevel feedback scheduling algorithm
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

Q. Scheduling is :
a) allowing a job to use the processor
b) making proper use of processor
c) all of the mentioned
d) none of the mentioned

Q. Which of the following algorithms tends to minimize the process flow time ?
a) First come First served
b) Shortest Job First
c) Earliest Deadline First
d) Longest Job First

Q. Which of the following statements are true ? (GATE 2010)

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
a) I only
b) I and III only
c) II and III only
d) I, II and III

Q. The two steps of a process execution are :

a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst

Q. A process is selected from the ______ queue by the ________ scheduler, to be executed.
a) blocked, short term
b) wait, long term
c) ready, short term
d) ready, long term

GATE –

Q. Which scheduling policy is most suitable for a time-shared operating systems?

(a) Shortest Job First (b) Round Robin
(c) First Come First Server (d) Elevator

Q. Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a uniprocessor machine.
Which of the following processor scheduling algorithms will result in the maximum throughput?
(a) Round-Robin (b) Shortest-Job-First
(c) Highest-Response-Ratio-Next (d) First-Come-First-Served

Q. Which of the following scheduling algorithms is non-preemptive?

(a) Round-Robin (b) First In First Out
(c) Multilevel Queue Scheduling (d) Multilevel Queue Scheduling with Feedback

Q. Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at
times 0, 2 and 6, respectively. How many context switches are needed if the operating system
implements a shortest remaining time first scheduling algorithm? Do not count the context
switches at time zero and at the end.
(a) 1 (b) 2 (c) 3 (d) 4

Q. Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications.
Match entries in Group 1 to entries in Group 2.

Group I Group II
(P) Gang Scheduling (1) Guaranteed Scheduling
(Q) Rate Monotonic Scheduling (2) Real-time Scheduling
(R) Fair Share Scheduling (3) Thread Scheduling

(a) P – 3 Q – 2 R – 1
(b) P – 1 Q – 2 R – 3
(c) P – 2 Q – 3 R – 1
(d) P – 1 Q – 3 R – 2

Q. Four jobs to be executed on a single processor system arrive at time 0 in the order A, B, C, D.
their burst CPU time requirements are 4, 1, 8, 1 time units respectively. The completion time of A
under round robin scheduling with time slice of one time unit is
(a) 10 (b) 4 (c) 8 (d) 9

Q. Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30
units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of
time doing computation, and the last 10% of time doing I/O again. The operating system uses a
shortest remaining compute time first scheduling algorithm and schedules a new process either
when the running process gets blocked on I/O or when the running process finishes its compute
burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage
of time does the CPU remain idle?

(a) 0% (b) 10.6% (c) 30.0% (d) 89.4%

q. The strategy of making processes that are logically runnable to be temporarily suspended is
called :
a) Non preemptive scheduling
b) Preemptive scheduling
c) Shortest job first
d) First come First served
Q. With multiprogramming, ______ is used productively.
a) time
b) space
c) money
d) all of the mentioned

Q In the following cases non – preemptive scheduling occurs :

a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
d) All of the mentioned

Q. Scheduling is done so as to :
a) increase the turnaround time
b) decrease the turnaround time
c) keep the turnaround time same
d) there is no relation between scheduling and turnaround time

Q. Waiting time is :
a) the total time in the blocked and waiting queues
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

Q. Response time is :
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) none of the mentioned