OPERATING SYSTEMS FOR COMPUTERS
OS FUNCTIONS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
First-come, first-serve
|
|
|
Shortest-job-first scheduling
|
|
|
Round-robin scheduling
|
|
|
Priority scheduling
|
|
|
Multilevel Queue scheduling
|
Detailed explanation-1: -First Come First Serve In this type of algorithm, the process which requests the CPU gets the CPU allocation first. This scheduling method can be managed with a FIFO queue. As the process enters the ready queue, its PCB (Process Control Block) is linked with the tail of the queue.
Detailed explanation-2: -First come first serve (FCFS) scheduling algorithm simply schedules the jobs according to their arrival time. The job which comes first in the ready queue will get the CPU first. The lesser the arrival time of the job, the sooner will the job get the CPU.
Detailed explanation-3: -1. First-Come, First-Served (FCFS) In this scheduling algorithm, jobs are executed on a first come, first serve basis irrespective of burst time or priority. It is both a preemptive and non-preemptive scheduling algorithm.
Detailed explanation-4: -Preemptive scheduling is when a process transitions from a running state to a ready state or from a waiting state to a ready state. Non-preemptive scheduling is employed when a process terminates or transitions from running to waiting state.