Operating system mcqs cpu scheduling algorithms

YOU may join our Telegram for all subjects PDF BOOKS.

https://t.me/+Ccx9McEia7wyODg1

Operating system mcqs cpu scheduling algorithms

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is Scheduling?
A
allowing a job to use the processor
B
making proper use of processor
C
all of the mentioned
D
none of the mentioned
Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Preemptive Shortest Job First scheduling is sometimes called .....
A
Fast SJF scheduling
B
EDF scheduling - Earliest Deadline First
C
HRRN scheduling - Highest Response Ratio Next
D
SRTN scheduling - Shortest Remaining Time Next
Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 4 Explanation: 
I) Shortest remaining time first scheduling is a preemptive version of shortest job scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU. II) Preemption may cause starvation. If priority based scheduling with preemption is used, then a low priority process may never get CPU. III) Round Robin Scheduling improves response time as all processes get CPU after a specified time.
Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following scheduling algorithms gives minimum average waiting time?
A
FCFS
B
SJF
C
Round - robin
D
Priority
There are 5 questions to complete.