Register

NIELIT STA 2021

576 views
1 1 vote

Consider a system with page size p and average process size m and size of each page table entry is e. what is the amount of space required by page table ? 

  1. me / p
  2. mp / e
  3. mpe
  4. pe / m

1 Answer

Best answer
2 2 votes
Given Process size is m , and page size as p and page table entry is e.

we know that process is divided into pages . so,

noof pages= process size/page size =m/p

we know that page table size = noof pages * page table entry size(PTE)=  (m/p)*e

So option A is correct
• selected by
Voting & Accepting an answer helps improve the community
← Previous · NIELIT STA 2021Next → · NIELIT STA 2021
← Previous in category · Gate@Zeal test serie...Next in category → · Demand Paging
Position:
Show:

Related questions

0 0 votes
1 1 answer
694
694 views
rapidxy asked Dec 14, 2021
694 views
NIELIT STQC STA 2021
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is :A)40(2)^40 B)40(2)^39C)41(2)^40D)41(2)^39
1 1 vote
0 0 answers
630
630 views
rsansiya111 asked Dec 6, 2021
630 views
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
0 0 votes
0 0 answers
382
382 views
rsansiya111 asked Dec 6, 2021
382 views
NIELIT STA 2021
Consider a relation R with attributes {A,B,C} and functional dependency set S ={A → B, A → C}. Then relation R can be decomposed into two relations: R1{A,B} AND R2{A,C}R...
0 0 votes
1 1 answer
1.0k
1.0k views
rsansiya111 asked Dec 6, 2021
1,038 views
NIELIT STA 2021
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1$2n^{2}$2^n2n – 1