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

Related MCQs

• In paged memory systems, if the page size is increased, then the internal fragmentation generally                          
• Memory protection in a paged environment is accomplished by                          
• 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.
• 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                          
• Users                that their processes are running on a paged system.
• When a program tries to access a page that is mapped in address space but not loaded in physical memory, then                          
• For larger page tables, they are kept in main memory and a                      points to the page table.
• A page fault occurs when
• A page fault occurs when?
• When a page fault occurs, the state of the interrupted process is