Question
State true or false This scheduling algorithm is
not ideal for time sharing systems. Read the below passage and answer the questions First Come First Serve (FCFS) Â is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation first. This is managed with a FIFO queue. The full form of FCFS is First Come First Serve. As the process enters the ready queue, its PCB (Process Control Block) is linked with the tail of the queue and, when the CPU becomes free, it should be assigned to the process at the beginning of the queue.Solution
Disadvantages of FCFS
- The non-preemptive nature of the algorithm makes other small processes wait  until the current program completes.
- Short processes have to wait for a long time until the bigger process which arrives before it.
- The waiting time is usually high .
- This scheduling algorithm is not ideal for time sharing systems.
More IT Operating System Questions
The rate of change of which of the following determines angular velocity?
If cream is removed from milk, its density –
Proteins are assembled from how many amino acids?
Kindly Study the following questions carefully and choose the right answer:
Transpiration is mainly effective during _______ ?
Group number and valency have no relation in
Two charges +4ÎĽC and +9ÎĽC are separated by 60 cm. Where should a third charge be placed so that it experiences zero net force? (from +4ÎĽC charge)
Which electromagnetic wave has the longest wavelength?
The centre of gravity of a sprinter during the race lies –
The SI unit of surface tension is:
