Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Experiment name

Preemptive vs.non-preemptive scheduling

Choose difficulty:

Beginner

Intermediate

Advanced

What is the difference between preemption and non-preemption?

a: Whether or not a ready process can be involuntarily terminated Explanation

Explanation

b: Whether or not a process in the middle of execution can be interrupted Explanation

Explanation

c: Whether or not a blocked process can have its resources involuntarily taken away from it Explanation

Explanation

d: Waiting time is more in preemptive scheduling and less in non-preemptive Explanation

Explanation

In which of the following Algorithms does the first process get allocated to the CPU first?

a: FCFS Explanation

Explanation

b: SJF Explanation

Explanation

c: Round Robin Explanation

Explanation

d: None of the above Explanation

Explanation

The SJF algorithm is :

a: nonpreemptive only Explanation

Explanation

b: preemptive only Explanation

Explanation

c: can be preeptive or non preemptive Explanation

Explanation

d: None of the above Explanation

Explanation

In RR algorithm the new process will go to the :

a: top of the ready queue Explanation

Explanation

b: tail of the ready queue Explanation

Explanation

c: anywhere in the ready queue Explanation

Explanation

d: None of the above Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)