986 views
2 votes
2 votes
A hypothetical system OSXZ_09 implements paging. Given LAS = 4 GB, PAS = 64 MB, Page size = 4 KB. A protection bit and a reference bit is also present in a page table entry. Then the size of the innermost page table is ____ B.

Note : The memory is byte addressable.

Please log in or register to answer this question.

Related questions

493
views
2 answers
0 votes
shikhar500 asked Jan 8, 2023
493 views
We know that the paging scheme suffers from internal fragmentation.S1 : If the CPU attempts to access the unused portion of the last page, the valid/invalid bits will ... explain me this ? we have to select from s1 and s2 which is correct
940
views
1 answers
0 votes
LRU asked Nov 3, 2021
940 views
An operating system implements a single level paging. This system uses Translation Lookaside Buffer (TLB) and Physical Address Cache (PAC) as well. TLB has a hit ... are in main memory, the effective memory access time is ______ (ns).
2.6k
views
2 answers
2 votes
mcjoshi asked Oct 9, 2016
2,597 views
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16$bits. What is the ... . $32MB$ d). $32GB$
3.7k
views
1 answers
1 votes
Vishal Goyal asked Dec 4, 2016
3,709 views
Consider the following statements:1. Paging suffers from internal fragmentation and segmentation suffers from external fragmentation.2. FIFO replacement policy ignores locality of reference ... 3 and 4Only 2 and 3Only 1 and 4Only 1 and 2