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

Related MCQs

• 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
• In semaphore the process blocked by wait operation is unblocked if
• A Semaphore is initialized to
• In semaphore, the process executing the wait is blocked if
• The FIFO algorithm
• 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 uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
• Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely which are called
• In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a;the output is.