adplus-dvertising
frame-decoration

Question

When there is a large logical address space, the best way of paging would be :

a.

not to page

b.

a two level paging algorithm

c.

the page table itself

d.

all of the mentioned

Answer: (b).a two level paging algorithm

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. When there is a large logical address space, the best way of paging would be :

Similar Questions

Discover Related MCQs

Q. In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is :

Q. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading,

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

Q. In segmentation, each address is specified by :

Q. In paging the user provides only ________ which is partitioned by the hardware into ________ and ______

Q. Each entry in a segment table has a :

Q. The segment base contains the :

Q. The segment limit contains the :

Q. The offset ā€˜dā€™ of the logical address must be :

Q. If the offset is legal :

Q. When the entries in the segment tables of two different processes point to the same physical location :

Q. The protection bit is 0/1 based on :

Q. If there are 32 segments, each of size 1Kb, then the logical address should have :

Q. Consider a computer with 8 Mbytes of main memory and a 128 K 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 ?

Q. A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because :

Q. Which one of the following is not a secondary storage?

Q. Which private network uses storage protocol rather than networking protocol?

Q. The time for the disk arm to move the heads to the cylinder containing the desired sector is called

Q. Which algorithm of disk scheduling selects the request with the least seek time from the current head positions?

Q. Operating system is responsible for