To Implement CPU Scheduling Algorithms

Post Test

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

2. What is 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

3. Which of the following process scheduling algorithm may lead to starvation?

a) FCFS
b) Round Robin
c) SJF
d) None of the mentioned

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

5. In which of the following scheduling criteria, context switching will never take place ?

a) Round Robin
b) Preemptive SJF
c) Non-Preemptive SJF
d) Preemptive priority