In memory management where replacement is allowed in First-in-First-out (FIFO) fashion

Related MCQs

• Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
• 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 memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
• In Dynamic partition of main memory in memory management, the sized of process and memory partition is
• Match the following pairs A. Logical address(1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. Physical address (3) A memory location independent of the current assignment of data to memory
• The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to
• In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
• 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
• 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,