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
Which of the following fertiliser is both in ammonium and nitrate form?
Plants with very short life spans and complete several life cycles in a season is calledÂ
Which plant hormone is responsible for cell elongation in fruits ?
Goblet cells-are not present in which part of respiratory tract?
When there is crossing over between centromere and gene under consideration, the segregation of that gene takes place during:
Which of the following is nematicide:
Which model is used for wind erosion estimation?
What is the primary reason for classifying horticulture separately from agriculture?
Which is not a measure of central tendency?
Which physiological process declines first during seed deterioration?
