adplus-dvertising
frame-decoration

Question

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.

m, n

b.

n, m

c.

m – n, m

d.

m – n, n

Posted under Operating System

Answer: (d).m – n, n

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. 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...

Similar Questions

Discover Related MCQs

Q. With paging there is no ________ fragmentation.

Q. The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.

Q. Paging increases the ______ time.

Q. Smaller page tables are implemented as a set of _______

Q. The page table registers should be built with _______

Q. For larger page tables, they are kept in main memory and a __________ points to the page table.

Q. For every process there is a __________

Q. Time taken in memory access through PTBR is :

Q. Each entry in a Translation look-aside buffer (TLB) consists of :

Q. If a page number is not found in the TLB, then it is known as a :

Q. An ______ uniquely identifies processes and is used to provide address space protection for that process.

Q. The percentage of times a page number is found in the TLB is known as :

Q. Memory protection in a paged environment is accomplished by :

Q. When the valid – invalid bit is set to valid, it means that the associated page :

Q. Illegal addresses are trapped using the _____ bit.

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

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 :