edited by
17,286 views

3 Answers

Best answer
51 51 votes
Total no of pages $= \frac{2^{32}}{2^{12}} = 2^{20}$

We need a PTE for each page and an entry is $4$ bytes.

So, page table size  $= 4 \times 2^{20} = 2^{22}\;\textsf{B} = 4\;\textsf{MB}.$
edited by
9 9 votes

LA=32 bits

Page size or offset =4KB=>12 bits 

pages=32-12=20 bits ..so there are 220 pages .For each page there would be an entry in the page table ..and PTE=4 bytes

page table size= 220 * 4 B=> 4MB

Answer:
Position:
Show:

Related questions

88 88 votes
15 answers 15 answers
30.6k
30.6k views
Misbah Ghaya asked Feb 13, 2015
30,589 views
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
56 56 votes
5 answers 5 answers
19.0k
19.0k views
Misbah Ghaya asked Feb 12, 2015
19,025 views
The output of the following C program is_____________.void f1 ( int a, int b) { int c; c = a; a = b; b = c; } void f2 ( int * a, int * b) { int c; c = * a; *a = *b; *b = ...
73 73 votes
9 answers 9 answers
34.2k
34.2k views
go_editor asked Feb 12, 2015
34,230 views
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...
50 50 votes
3 answers 3 answers
18.9k
18.9k views
Misbah Ghaya asked Feb 11, 2015
18,902 views
Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrenc...