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.
Which of the following is NOT a metamorphic rock?
Which is the 1st Indian city to provide 24*7 drinking water supply?
Which city in Uttar Pradesh is known as the 'City of Nawabs'?
Sultanpur village of Maharashtra has now been renamed as _______ in memory of a police officer who was a resident of their village who laid down his lif...
First Mineral Policy of Uttar Pradesh was declared on ........?
Which river forms the major part of the eastern boundary of Uttar Pradesh?
What is the primary aim of the Credit Assistance Program for Jan Aushadhi Kendras launched by the partnership between SIDBI and PMBI?
The FAST Trade Connect e-Platform aims to achieve which of the following goals?
Uttar Pradesh Van Mahotsav was started in which year?
Who among the following was the tenth Sikh Guru?
