[Solved] The FIFO algorithm

McqMate

Q.	The FIFO algorithm
A.	executes first the job that last entered the queue
B.	executes first the job that first entered the queue
C.	executes first the job with the least processor needs
D.	executes first the job that has been in the queue the longest
Answer» B. executes first the job that first entered the queue

1.8k

0

Do you find this helpful?

18

View all MCQs in

Operating System Advanced

Discussion

No comments yet

Related MCQs

In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called
In memory management where replacement is allowed in First-in-First-out (FIFO) fashion
In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO,
In disk scheduling, SCAN algorithm states
Dijkstra’s banker’s algorithm in an operating-system solves the problem of
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a
Banker’s algorithm for resource allocation deals with
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on