UGC NET CSE | December 2014 | Part 2 | Question: 40

makhdoom ghaya asked Jul 23, 2016 • edited May 29, 2020 by soujanyareddy13

3,967 views

2 votes

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is $8$ m.sec. if an empty frame is available or if the replaced page is not modified, and it takes $20$ m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified $70$% of the time ?

$11.6$ m.sec.
$16.4$ m.sec.
$28$ m.sec.
$14$ m.sec.

Operating System
ugcnetcse-dec2014-paper2
operating-system
demand-paging

+ –

makhdoom ghaya asked Jul 23, 2016 • edited May 29, 2020 by soujanyareddy13

makhdoom ghaya

4.0k views

See all

1 1 comment

swami_9

commented Jul 10, 2021

can anyone please tell what is the meaning of “replaced page is modified”.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 votes

Service a page fault=8msec.

Page is not modified=20m.sec.

Page replace=70% of time

the average access time to service a page fault=0.7⨉20+0.3⨉8=14+2.4=16.4ms

srestha answered Jul 25, 2016 • edited Jul 25, 2016 by srestha

srestha

See all

2 2 Comments

Tauhin Gangwar

commented Jul 25, 2016

srestha...u did wrong..

if an empty frame is available or if the replaced page is not modified = 8 m.secs.,

if the replaced page is modified. = 20 msec

2 votes

srestha

commented Jul 25, 2016

yes @Tauhin ,thanks

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

4 votes

1 answer

makhdoom ghaya asked Jul 23, 2016

4,423 views

UGC NET CSE | December 2014 | Part 2 | Question: 39
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by $\frac{x}{2}$ $\frac{xz}{2}$ $\sqrt{2xz}$ $\frac{\sqrt{xz}}{2}$

For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum ...

makhdoom ghaya

4.4k views

makhdoom ghaya asked Jul 23, 2016

Operating System
ugcnetcse-dec2014-paper2
operating-system
paging

+ –

2 votes

1 answer

makhdoom ghaya asked Jul 22, 2016

5,201 views

UGC NET CSE | December 2014 | Part 2 | Question: 38
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No two processes may be simultaneously inside ... running outside its critical section may block other processes. Processes do not wait forever to enter its critical section.

Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No t...

makhdoom ghaya

5.2k views

makhdoom ghaya asked Jul 22, 2016

Operating System
ugcnetcse-dec2014-paper2
operating-system
critical-section

+ –

2 votes

4 answers

makhdoom ghaya asked Jul 22, 2016

1,670 views

UGC NET CSE | December 2014 | Part 2 | Question: 37
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used? $1135 K$ $335 K$ $1065 K$ $320 K$

A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started simultaneous...

makhdoom ghaya

1.7k views

makhdoom ghaya asked Jul 22, 2016

Operating System
ugcnetcse-dec2014-paper2
operating-system
process

+ –

2 votes

1 answer

makhdoom ghaya asked Jul 22, 2016

1,006 views

UGC NET CSE | December 2014 | Part 2 | Question: 36
Consider the following justifications for commonly using the two-level $CPU$ scheduling: I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the $FIFO$. III. Because it facilitates putting some set ... following is true ? $I, III$ and $IV$ $I$ and $II$ $III$ and $IV$ $I$ and $III$

Consider the following justifications for commonly using the two-level $CPU$ scheduling:I. It is used when memory is too small to hold all the ready processes.II. Because...

makhdoom ghaya

1.0k views

makhdoom ghaya asked Jul 22, 2016

Operating System
ugcnetcse-dec2014-paper2
operating-system
process-scheduling

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 2 Comments reply

Please log in or register to add a comment.

Related questions

1 1 comment

2 2 Comments