A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 50 distinct pages in some order and then accesses the same 50 pages in reverse order. How many page faults will occur?

A

96

B

100

C

97

D

92

A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, …, 100 in that order, and repeats the access sequence THRICE. Which one of the following page replacement policies experiences the same number of page faults as the optimal page replacement policy for this program?

A

Least-recently-used

B

First-in-first-out

C

Last-in-first-out

D

Most-recently-used

Fact 1: Eyeglass frames cost between $35 and $350.
Fact 2: Some eyeglass frames are made of titanium.
Fact 3: Some eyeglass frames are made of plastic.

If the first three statements are facts, which of the following statements must also be a fact?
I: Titanium eyeglass frames cost more than plastic frames.
II: Expensive eyeglass frames last longer than cheap frames.
III: Only a few eyeglass frames cost less than $35.

A

I only

B

II only

C

II and III only

D

None of the statements is a known fact.

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

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

A

OPTIMAL < LRU < FIFO

B

OPTIMAL < FIFO < LRU

C

OPTIMAL = LRU

D

OPTIMAL = FIFO

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Let a computer system has main memory size of 3 page frames which are initially empty and it is running on demand paged virtual memory system. The number of page faults under LRU and FIFO page replacement policy are respectively:

A

9, 6

B

6, 3

C

6, 9

D

3 , 6

A virtual memory system uses FIFO page replacement policy and allocates a fixed number of frames to the process. Consider the following statements M : Increasing the number of page frames allocated to a process sometimes increases the page fault rate N : Some programs do not exhibit locality of reference Which one of the following is true?

A

Both M and N are true and N is the reason for M

B

Both M and N are true but N is not the reason for M

C

Both M and N are false

D

M is false, but N is true

Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used)

A

3

B

5

C

4

D

None of these

A computer has sixteen pages of virtual address space but the size of main memory is only four frames. Initially the memory is empty. A program references the virtual pages in the order of 0, 2, 4, 5, 2, 4, 3, 11, 2, 10. How many page faults occur if LRU page replacement algorithm is used?

A

3

B

5

C

7

D

8

How many page faults will occur if FIFO Page replacement algorithm is used for the following reference string with three-page frames? 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1

A

17

B

14

C

16

D

15

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

Related Questions