The correct answer is: A. Non Preemptive Scheduling
First-in-First-Out (FIFO) scheduling is a non-preemptive scheduling algorithm. This means that once a process has been given control of the CPU, it will continue to run until
it either completes or voluntarily relinquishes control. This can lead to problems if a process is stuck in an infinite loop or is taking a long time to complete a task, as other processes will be blocked from running until the first process finishes.Preemptive scheduling algorithms, on the other hand, allow the operating system to interrupt a running process and give control to another process. This can be useful for ensuring that all processes get a fair share of the CPU, or for dealing with processes that are taking too long to complete.
Fair share scheduling is a type of preemptive scheduling algorithm that ensures that all processes get a fair share of the CPU. This is done by dividing the CPU time into equal slices, and then giving each process a slice of time in turn.
Deadline scheduling is a type of preemptive scheduling algorithm that ensures that all processes meet their deadlines. This is done by giving each process a deadline, and then scheduling the processes so that they all finish before their deadlines.
I hope this helps!