Dirty bit for a page in a page table

Related MCQs

• 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
• 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
• In 16 G byte disk with 512-bit block, the bit table requires
• 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.
• In secondary storage management, bit table, for each block on disk a vector contains
• In bit table used for Free space management in secondary storage
• 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 for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of
• 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.
• 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.