In paged memory systems, if the page size is increased, then the internal fragmentation generally                          

Related MCQs

• 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
• 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.
• In internal fragmentation, memory is internal to a partition and                          
• Memory protection in a paged environment is accomplished by                          
• The larger the block size, the the internal fragmentation.
• In question 2, if the number of page frames is increased to 4, then the number of page transfers                          
• 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.
• 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?