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

The waiting time for process P2 is 9ms.

The waiting time for process P2 is 3ms.

The waiting time for process P2 is 0ms.

The waiting time for process P2 is 16ms.

The waiting time for process P2 is 9ms.

Throughput of a system is

Number of times the program is invoked by the system

Number of programs processed by it per unit time

Number of times the program is invoked by the system

Number of requests made to a program by the system

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

The waiting time for process P3 is 3ms.

The waiting time for process P3 is 0ms.

The waiting time for process P3 is 16ms.

The waiting time for process P3 is 9ms.

Scheduling is done so as to:

there is no relation between scheduling and turnaround time

Te purpose of CPU Scheduling is:

keep the response time the same

allowing a job to use the processor

CPU scheduling is the basis of ____________.

multiprogramming operating systems

The “turn-around” time of a user job is the

time taken for the job to move from assembly phase to completion phase.

time since its submission to the time its results become available.

time duration for which the CPU is allotted to the job.

total time taken to execute the job.

time taken for the job to move from assembly phase to completion phase.

Shortest Job First executes first the job

that has been in the queue for the longest

Which of following is not an advantage of multiprogramming ?

ability to assign priorities of jobs

Spooling is most beneficial where

Jobs are evenly divided as I/O bound and CPU bound

In a multi-programming environment :

a single user can execute many programs at the same time

the processor executes more than one process at a time

the programs are developed by more than one person

more than one process resides in the memory

a single user can execute many programs at the same time

A scheduling algorithm is fair

if a process is starved, detect it and run it with high priority

only if a queue is used for scheduling

the process which is running is found

the processes waiting for I/O are found

the process which is running is found

the processes waiting for the processor are found

With the round robin CPU scheduling in a time-shared system ________.

Using extremely small time slices improve performance

Using very large time slice degenerates in to first come first served algorithm

Using extremely small time slices improve performance

Using extremely small time slices degenerate in to last in first out algorithm

Using medium sized time slices leads to shortest request time first algorithm

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 ________.

Shortest Remaining Time Next (SRTN) Scheduling

Priority Based Preemptive Scheduling

Which of the following is a criterion to evaluate a scheduling algorithm?

CPU Utilization: Keep CPU utilization as high as possible

Throughput: number of processes completed per unit time

Waiting Time: Amount of time spent ready to run but not running

An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

Round robin scheduling algorithm

Shorest job - first scheduling algorithm

104 + Mcqs in Cpu Scheduling in Operating System Page 2 McqOptions

51.	Which of the following scheduling policy is well suited for a time shared operating system?
A.	First come first serve.
B.	Shortest job first
C.	Round robin
D.	None of the above.
Answer» D. None of the above.

Discussion

52.	In process scheduling, ………………… determines which ready process will be executed next by processor.
A.	long term scheduling
B.	medium term scheduling
C.	short term scheduling
D.	none of the above
Answer» D. none of the above

Discussion

53.	We have a uniprocessor machine where a set of n tasks with known run times r1, r2, r3,….rn are to be run. What will be the maximum throughput result of the processor scheduling algorithm?
A.	Shortest Job First
B.	First Come First Served
C.	Round Robin
D.	Highest Response Ratio Next
Answer» B. First Come First Served

Discussion

54.	On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively. Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______.
A.	3
B.	5
C.	7
D.	9
Answer» E.

Discussion

55.	Consider the following set of processes, the length of the CPU burst time given in milliseconds :Process Burst timeP1 6P2 8P3 7P4 3Assuming the above process being scheduled with the SJF scheduling algorithm :
A.	The waiting time for process P2 is 3ms.
B.	The waiting time for process P2 is 0ms.
C.	The waiting time for process P2 is 16ms.
D.	The waiting time for process P2 is 9ms.
Answer» D. The waiting time for process P2 is 9ms.

Discussion

56.	Throughput of a system is
A.	Number of programs processed by it per unit time
B.	Number of times the program is invoked by the system
C.	Number of requests made to a program by the system
D.	None of the above
Answer» B. Number of times the program is invoked by the system

Discussion

57.	Match the following:List – I - - - - - - - - - - - - - - - - - - - - - - - - - List – IIa. Multilevel feedback queue - - - - - - - - - i. Time-slicingb. FCFS - - - - - - - - - - - - - - - - - - - - - - - -ii. Criteria to move processes between queuesc. Shortest process next - - - - - - - - - - - -iii. Batch processingd. Round robin scheduling - - - - - - - - - - -iv. Exponential smoothing
A.	a-i, b-iii, c-ii, d-iv
B.	a-iv, b-iii, c-ii, d-i
C.	a-iii, b-i, c-iv, d-i
D.	a-ii, b-iii, c-iv, d-i
Answer» E.

Discussion

58.	Consider the following set of processes, the length of the CPU burst time given in milliseconds :Process Burst timeP1 6P2 8P3 7P4 3Assuming the above process being scheduled with the SJF scheduling algorithm :
A.	The waiting time for process P3 is 3ms.
B.	The waiting time for process P3 is 0ms.
C.	The waiting time for process P3 is 16ms.
D.	The waiting time for process P3 is 9ms.
Answer» E.

Discussion

59.	Which of the following statements are true ?I. Shortest remaining time first scheduling may cause starvationII. Preemptive scheduling may cause starvationIII. 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
Answer» E.

Discussion

60.	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
Answer» C. keep the turnaround time same

Discussion

61.	Te purpose of CPU Scheduling is:
A.	increase the response time
B.	keep the response time the same
C.	decrease the response time
D.	None of these
Answer» D. None of these

Discussion

62.	CPU Scheduling is :
A.	allowing a job to use the processor
B.	making proper use of processor
C.	Both a and b
D.	None of these
Answer» D. None of these

Discussion

63.	CPU scheduling is the basis of ____________.
A.	multiprocessor systems
B.	multiprogramming operating systems
C.	larger memory sized systems
D.	None of these
Answer» C. larger memory sized systems

Discussion

64.	The “turn-around” time of a user job is the
A.	time since its submission to the time its results become available.
B.	time duration for which the CPU is allotted to the job.
C.	total time taken to execute the job.
D.	time taken for the job to move from assembly phase to completion phase.
Answer» D. time taken for the job to move from assembly phase to completion phase.

Discussion

65.	In which scheduling policies, context switching never takes place
A.	FCFS
B.	round robin
C.	Shortest job first
D.	Pre-empitive
Answer» B. round robin

Discussion

66.	Shortest Job First executes first the job
A.	with the least processor needs
B.	that first entered the queue
C.	that has been in the queue for the longest
D.	that last entered the queue
Answer» B. that first entered the queue

Discussion

67.	Which of the following statements are true ?i) Shortest remaining time first scheduling may cause starvationii) Preemptive scheduling may cause starvationiii) Round robin is better than FCFS in terns of response time
A.	i only
B.	i and iii only
C.	ii and iii only
D.	i, ii and iii
Answer» E.

Discussion

68.	Dispatcher function is to
A.	put tasks in I/O wait
B.	schedule tasks in processor
C.	change task priorities
D.	All of above
Answer» B. schedule tasks in processor

Discussion

69.	Belady anomaly occurs in ?
A.	LIFO
B.	FIFO
C.	LRU
D.	NRU
Answer» C. LRU

Discussion

70.	Which is non pre-emptive
A.	Round robin
B.	FIFO
C.	MQS
D.	MQSF
Answer» C. MQS

Discussion

71.	Creating a job queue is a function of
A.	Spooler
B.	Interperator
C.	Complier
D.	Drive
Answer» B. Interperator

Discussion

72.	Which among following scheduling algorithms give minimum average waiting time
A.	FCFS
B.	SJF
C.	Round robin
D.	On priority
Answer» C. Round robin

Discussion

73.	Which of following is not an advantage of multiprogramming ?
A.	increased throughput
B.	shorter response time
C.	ability to assign priorities of jobs
D.	decreased system overload
Answer» E.

Discussion

74.	Spooling is most beneficial where
A.	Jobs are I/O bound
B.	Jobs are CPU bound
C.	Jobs are evenly divided as I/O bound and CPU bound
D.	All of above
Answer» D. All of above

Discussion

75.	Which scheduling policy is most suitable for time shared operating system ?
A.	Shortest job first
B.	FCFS
C.	LCFS
D.	Round robin
Answer» E.

Discussion

76.	Which of the following state transitions is not possible ?
A.	blocked to running
B.	ready to running
C.	blocked to ready
D.	running to blocked
Answer» B. ready to running

Discussion

77.	In a multi-programming environment :
A.	the processor executes more than one process at a time
B.	the programs are developed by more than one person
C.	more than one process resides in the memory
D.	a single user can execute many programs at the same time
Answer» D. a single user can execute many programs at the same time

Discussion

78.	If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.
A.	full,little
B.	full,lot
C.	empty,little
D.	empty,lot
Answer» D. empty,lot

Discussion

79.	_________ 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.
A.	Deadlock
B.	Starvation
C.	Dormant
D.	None of the above
Answer» B. Starvation

Discussion

80.	The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________ .
A.	Ready queue
B.	Device queue
C.	Input queue
D.	Priority queue
Answer» D. Priority queue

Discussion

81.	A scheduling algorithm is fair
A.	if no process faces starvation
B.	if a process is starved, detect it and run it with high priority
C.	if it uses semaphores
D.	only if a queue is used for scheduling
Answer» B. if a process is starved, detect it and run it with high priority

Discussion

82.	Which scheduler controls the degree of multi programming?
A.	Short term scheduler
B.	Long term scheduler
C.	Middle term scheduler
D.	None of the above
Answer» C. Middle term scheduler

Discussion

83.	FIFO scheduling is ________.
A.	Preemptive Scheduling
B.	Non Preemptive Scheduling
C.	Deadline Scheduling
D.	Fair share scheduling
Answer» C. Deadline Scheduling

Discussion

84.	In the multi-programming environment, the main memory consisting of _________ number of process.
A.	Greater than 100
B.	Only one
C.	Greater than 50
D.	More than one
Answer» E.

Discussion

85.	The degree of Multiprogramming is controlled by
A.	CPU Scheduler
B.	Context Switching
C.	Long-term Scheduler
D.	Medium term Scheduler
Answer» D. Medium term Scheduler

Discussion

86.	Round robin scheduling is essentially the preemptive version of ________.
A.	FIFO
B.	Shortest job first
C.	Shortes remaining
D.	Longest time first
Answer» B. Shortest job first

Discussion

87.	The number of processes completed per unit time is known as __________.
A.	Output
B.	Throughput
C.	Efficiency
D.	Capacity
Answer» C. Efficiency

Discussion

88.	Saving the state of the old process and loading the saved state of the new process is called ________.
A.	Context Switch
B.	State
C.	Multi programming
D.	None of the above
Answer» B. State

Discussion

89.	In the blocked state
A.	the processes waiting for I/O are found
B.	the process which is running is found
C.	the processes waiting for the processor are found
D.	none of the above
Answer» B. the process which is running is found

Discussion

90.	CPU Scheduling is the basis of _________ operating system.
A.	Batch
B.	Real time
C.	Multiprogramming
D.	Mono programming
Answer» D. Mono programming

Discussion

91.	________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
A.	Long term
B.	Short term
C.	Medium term
D.	None of the above
Answer» B. Short term

Discussion

92.	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.
A.	8 milliseconds
B.	8.2 milliseconds
C.	7.75 milliseconds
D.	3 milliseconds
Answer» C. 7.75 milliseconds

Discussion

93.	A major problem with priority scheduling is _________.
A.	Definite blocking
B.	Starvation
C.	Low priority
D.	None of the above
Answer» C. Low priority

Discussion

94.	_________ does the job of allocating a process to the processor.
A.	Long term scheduler
B.	Short term scheduler
C.	Medium term scheduler
D.	Dispatcher
Answer» E.

Discussion

95.	The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy bit becomes clear. This is called _____________ and a mechanism for the hardware controller to notify the CPU that it is ready is called ___________.
A.	Interrupt and Polling
B.	Polling and Spooling
C.	Polling and Interrupt
D.	Deadlock and Starvation
Answer» D. Deadlock and Starvation

Discussion

96.	With the round robin CPU scheduling in a time-shared system ________.
A.	Using very large time slice degenerates in to first come first served algorithm
B.	Using extremely small time slices improve performance
C.	Using extremely small time slices degenerate in to last in first out algorithm
D.	Using medium sized time slices leads to shortest request time first algorithm
Answer» B. Using extremely small time slices improve performance

Discussion

97.	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» D. None of the above

Discussion

98.	In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of Starvation of low priority processes may never execute, is resolved by __________.
A.	Terminating the process
B.	Aging
C.	Mutual Exclusion
D.	Semaphore
Answer» C. Mutual Exclusion

Discussion

99.	Which of the following is a criterion to evaluate a scheduling algorithm?
A.	CPU Utilization: Keep CPU utilization as high as possible
B.	Throughput: number of processes completed per unit time
C.	Waiting Time: Amount of time spent ready to run but not running
D.	All of the above
Answer» E.

Discussion

100.	An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
A.	FCFS scheduling algorithm
B.	Round robin scheduling algorithm
C.	Shorest job - first scheduling algorithm
D.	None of the above
Answer» D. None of the above

Discussion

Explore topic-wise MCQs in Operating System.

Which of the following scheduling policy is well suited for a time shared operating system?

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

We have a uniprocessor machine where a set of n tasks with known run times r1, r2, r3,….rn are to be run. What will be the maximum throughput result of the processor scheduling algorithm?

On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively. Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______.

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

Throughput of a system is

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

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

Scheduling is done so as to:

Te purpose of CPU Scheduling is:

CPU Scheduling is :

CPU scheduling is the basis of ____________.

The “turn-around” time of a user job is the

In which scheduling policies, context switching never takes place

Shortest Job First executes first the job

Which of the following statements are true ?i) Shortest remaining time first scheduling may cause starvationii) Preemptive scheduling may cause starvationiii) Round robin is better than FCFS in terns of response time

Dispatcher function is to

Belady anomaly occurs in ?

Which is non pre-emptive

Creating a job queue is a function of

Which among following scheduling algorithms give minimum average waiting time

Which of following is not an advantage of multiprogramming ?

Spooling is most beneficial where

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

Which of the following state transitions is not possible ?

In a multi-programming environment :

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

_________ 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.

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

A scheduling algorithm is fair

Which scheduler controls the degree of multi programming?

FIFO scheduling is ________.

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

The degree of Multiprogramming is controlled by

Round robin scheduling is essentially the preemptive version of ________.

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

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

In the blocked state

CPU Scheduling is the basis of _________ operating system.

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

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.

A major problem with priority scheduling is _________.

_________ does the job of allocating a process to the processor.

The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy bit becomes clear. This is called _____________ and a mechanism for the hardware controller to notify the CPU that it is ready is called ___________.

With the round robin CPU scheduling in a time-shared system ________.

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 ________.

In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of Starvation of low priority processes may never execute, is resolved by __________.

Which of the following is a criterion to evaluate a scheduling algorithm?

An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

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

The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy bit becomes clear. This is called ___ and a mechanism for the hardware controller to notify the CPU that it is ready is called _.