Register

UGC NET CSE | December 2007 | Part 2 | Question: 38

• edited by
487 views

2 Answers

0 votes
0 votes
The optimum page size is optimised with bare minimum overheads. Its size in terms of page table entry and average process size is given by =square root of 2*average process sisze *page enry size. hence the option (B) is correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
2
go_editor asked Mar 28, 2020
406 views
UGC NET CSE | December 2007 | Part 2 | Question: 36
How many states can a process be in ? $2$ $3$ $4$ $5$
How many states can a process be in ?$2$$3$$4$$5$
User Avatar
0 votes
0 votes
2 answers
3
go_editor asked Mar 28, 2020
1,452 views
UGC NET CSE | December 2007 | Part 2 | Question: 37
A program has five virtual pages, numbered from $0$ to $4$. If the pages are referenced in the order $012301401234$, with three page frames, the total number of page faults with FIFO will be equal to : $0$ $4$ $6$ $9$
A program has five virtual pages, numbered from $0$ to $4$. If the pages are referenced in the order $012301401234$, with three page frames, the total number of page faul...
User Avatar
0 votes
0 votes
2 answers
4
go_editor asked Mar 28, 2020
1,685 views
UGC NET CSE | December 2007 | Part 2 | Question: 40
The aging algorithm with a = $0.5$ is used to predict run times. The previous four runs from oldest to most recent are $40, 20, 20,$ and $15$ msec. The prediction for the next time will be : $15$ msec. $25$ msec. $39$ msec. $40$ msec.
The aging algorithm with a = $0.5$ is used to predict run times. The previous four runs from oldest to most recent are $40, 20, 20,$ and $15$ msec. The prediction for the...
User Avatar
Link Copied!