There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

Which of the following page replacement algorithms suffers from Belady’s Anomaly?

A

Optimal replacement

B

LRU

C

FIFO

D

Both optimal replacement and FIFO

Segment replacement algorithms are more complex than page replacement algorithms because ____________

A

Segments are better than pages

B

Pages are better than segments

C

Segments have variable sizes

D

Segments have fixed sizes

Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page replacement algorithms with 3 frames, the number of page faults is?

A

16

B

15

C

14

D

11

Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page replacement algorithms with 4 frames, the number of page faults is?

A

16

B

15

C

14

D

11

Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For Optimal page replacement algorithms with 3 frames, the number of page faults is?

A

16

B

15

C

14

D

11

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

Applying the LRU page replacement to the following reference string. 1 2 4 5 2 1 2 4 The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2. How many page faults will occur?

A

2

B

3

C

4

D

5

What does Belady's Anomaly related to?

A

Page Replacement Algorithm

B

Memory Management Algorithm

C

Deadlock Prevention Algorithm

D

Disk Scheduling Algorithm

A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers ____________

A

decreases

B

increases

C

remains the same

D

none of the mentioned

Which of the following page replacement algorithms return the minimum number of page faults?

A

LRU replacement algorithm

B

Optimal page replacement algorithm

C

FIFO

D

Counting based replacement

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

Related Questions