Scribd
Upload
57 views

CPU Scheduling Algorithms MCQs

The document contains a table with 6 rows listing difficulty levels and number of options for questions, followed by sample questions and their corresponding options. It also includes additional scheduling related content such as estimating CPU busy fraction for a single processor system with new processes arriving at a rate of 10 per minute where each process requires 3 seconds of service time. The document provides information related to process scheduling algorithms, questions, and example scheduling scenarios.

Uploaded by

Vinod Rathod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
57 views

CPU Scheduling Algorithms MCQs

The document contains a table with 6 rows listing difficulty levels and number of options for questions, followed by sample questions and their corresponding options. It also includes additional scheduling related content such as estimating CPU busy fraction for a single processor system with new processes arriving at a rate of 10 per minute where each process requires 3 seconds of service time. The document provides information related to process scheduling algorithms, questions, and example scheduling scenarios.

Uploaded by

Vinod Rathod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Sr.No.

Difficulty Level Number of Options


1 1 4
2 1 4
3 2 4
4 2 4
5 3 4

6 3 4
Question
The most optimal scheduling algorithm is :
Which module gives control of the CPU to the process selected by the short - term schedular ?
Which of the following process scheduling algorithm may lead to starvation
If the quantum time of round robin algorithm is very large, then it is equivalent to:
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the sam
Assume every process requires 3 seconds of service time in a system with single processor. If new
processes are arriving at the rate of 10 processes per minute, then estimate the fraction of time CPU is
busy in system?

1 Min = 60 Sec=10
6Sec
50
Option A Option B Option C
First come first serve (FCFS) Shortest Job First (SJF) Round Robin (RR)
Dispatcher Interrupt Schedular
Shortest Job Next Round Robin FIFO
Shortest Job Next First in first out Lottery scheduling
Shortest remaining time first Round-robin with time quantum lesRound-robin with time quant

20% 30% 50%

P1 4
P2 3
P3 1
P4 2

RR=0.5
Option D Correct Answer
None of the above D
Threading A
None of the above A
None of the above B
Highest priority first with priority proportio A

60% C

You might also like