Virtual memory is

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 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.
• 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
• In Dynamic partition of main memory in memory management, the sized of process and memory partition is
• In virtual memory management, when local control policy is applied
• A fetch policy for virtual memory determines
• In virtual memory systems, dynamic address translation
• A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
• 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.