📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    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.
    A True Correct Answer Incorrect Answer
    B False Correct Answer Incorrect Answer

    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.

    Practice Next
    More IT Operating System Questions
    ask-question