Computer Science - Operating Systems Concepts - Discussion

Discussion Forum : Operating Systems Concepts - Section 4 (Q.No. 39)
39.
Indicate which is a pre-emptive scheduling algorithm
Round-robin
Shortest-job-next
Priority-based
All of the above
None of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
Discussion:
6 comments Page 1 of 1.

Yash said:   5 years ago
Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum. Once a process is executed for a given time period, it is preempted and other process executes for a given time period.

Bhushan said:   8 years ago
Round Robin : Preemptive.

SJN : preemptive and non preemptive.

Priority Based : non preemptive.

Shewangizaw Bogale said:   9 years ago
The answer is wrong.

All the given options are pre-emptive scheduling algorithm.

Vaibhav said:   9 years ago
The answer is wrong all are pre-emptive scheduling algorithm.

Joe Quaye said:   1 decade ago
The answer is wrong. Round robin gives access to processes equally, that defeats the purpose of pre-empted.

Priya said:   1 decade ago
All are pre-emptive. The process having less priority is pre-empted.

Post your comments here:

Your comments will be displayed after verification.