Machine-translated by Google. Questions are authored in English.
Top

Paging and Segmentation Questions and Answers

1.

Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table?

Exam Year(s)

GATE CS - 2025,

Answer: A

The maximum number of page table entries is \(2^{21}\).

A single-level page table needs one entry for each page of the logical address space. The page size is \(2048 = 2^{11}\) bytes, so 11 of the 32 logical address bits are the offset within a page:

\[ \text{entries} = \frac{2^{32}}{2^{11}} = 2^{21} \]

The 20-bit physical address decides the number of frames, \(2^{20}/2^{11} = 2^{9}\), and the width of each entry, but not how many entries there are. \(2^{20}\) wrongly takes the physical address width, and \(2^{22}\) and \(2^{24}\) assume smaller pages.

Please log in or register to report this question.

Loading…
Tags: Paging and Segmentation Questions and Answers || Paging and Segmentation MCQ Questions and Answers || Paging and Segmentation GK Questions and Answers || Paging and Segmentation GK MCQ Questions || Paging and Segmentation Multiple Choice Questions and Answers || Paging and Segmentation GK || GK on Paging and Segmentation || Operating Systems Questions and Answers || Operating Systems MCQ Questions and Answers || Operating Systems GK Questions and Answers || GK on Operating Systems