First - In - First - Out is non - preemptive scheduling algorithm - Operating System

Q.  What is the non - preemptive scheduling algorithm?
- Published on 27 Aug 15

a. Multilevel queue scheduling with feedback
b. Multilevel queue scheduling
c. First - In - First - Out
d. Round Robin

ANSWER: First - In - First - Out
 

    Discussion

  • Nirja Shah   -Posted on 12 Nov 15
    First In, First Out
    - It is also referred to as FIFO.

    - It is a method for organizing and manipulating a data buffer, where the oldest (first) entry, or 'head' of the queue, is processed first.

    - FCFS is also the jargon term for the FIFO operating system scheduling algorithm, which gives every process central processing unit (CPU) time in the order in which it is demanded.

    - A priority queue is neither FIFO or LIFO but they may adopt similar behaviour temporarily or by default.

    - Queueing theory encompasses these methods for processing data structures, as well as interactions between strict-FIFO queues.

Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)