When a program tries to access a page that is mapped in address space but not loaded in physical memory, then                          

Related MCQs

• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset.
• The address loaded into the memory address register of the memory is referred to as                          
• If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is
• A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because                          
• The            table contains the base address of each page in physical memory.
• A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is                          
• In                          mapping, the data can be mapped anywhere in the Cache Memory.
• The address of a page table in memory is pointed by                          
• For larger page tables, they are kept in main memory and a                      points to the page table.
• Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?