Memory Management Questions

MCQ bookmark_border

131.

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?

A

Both P and Q are true, and Q is the reason for P

B

Both P and Q are true, but Q is not the reason for P

C

P is false but Q is true

D

Both P and Q are false

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

132.

Users _______ that their processes are running on a paged system.

A

are aware

B

are unaware

C

may unaware

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

133.

If no frames are free, _____ page transfer(s) is/are required.

A

one

B

two

C

three

D

four

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

134.

When a page is selected for replacement, and its modify bit is set ____________

A

the page is clean

B

the page has been modified since it was read in from the disk

C

the page is dirty

D

the page has been modified since it was read in from the disk & page is dirty

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

135.

The aim of creating page replacement algorithms is to ____________

A

replace pages faster

B

increase the page fault rate

C

decrease the page fault rate

D

to allocate multiple pages to processes

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

136.

A FIFO replacement algorithm associates with each page the _______

A

time it was brought into memory

B

size of the page in memory

C

page after and before it

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

137.

What is the Optimal page-replacement algorithm?

A

Replace the page that has not been used for a long time

B

Replace the page that has been used for a long time

C

Replace the page that will not be used for a long time

D

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

138.

Optimal page-replacement algorithm is difficult to implement, because ____________

A

it requires a lot of information

B

it requires future knowledge of the reference string

C

it is too complex

D

it is extremely expensive

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

139.

LRU page-replacement algorithm associates with each page the ______

A

time it was brought into memory

B

the time of that page

C

page after and before it

D

all of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

140.

For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 How many page faults does the LRU page replacement algorithm produce?

A

10

B

15

C

11

D

12

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion