[Solved] In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and

Q.	In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
A.	The most recent page is removed at first
B.	The most recent page is removed at the last
C.	The most recent page is removed any time
D.	None of these
Answer» B. The most recent page is removed at the last

2.9k

Do you find this helpful?

View all MCQs in

Operating System Advanced

Discussion

No comments yet

Related MCQs

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.
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 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 memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
A policy in memory management referred as clock policy because one can visualize the page frames as laid out in
In memory management where replacement is allowed in First-in-First-out (FIFO) fashion
In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
Statement A: The placement policy determines where in real memory a process piece is to reside. Statement B: The fetch policy determines when a page should be bought into main 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 two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires