New RBI Grade B Notification Coming Soon... Prepare with Us!! Click here to enroll

    Register

    Question

    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.

    ___________________ is the amount of time taken to fulfill the request by the process. It can be calculated by taking the difference between the completion time and the arriving time.

    A Turn around Time Correct Answer Incorrect Answer
    B Waiting Time Correct Answer Incorrect Answer
    C Response Time Correct Answer Incorrect Answer
    D Response Ratio Correct Answer Incorrect Answer
    E None of these Correct Answer Incorrect Answer

    Solution

    The correct answer is A

    Practice Next
    ×
    ×