adplus-dvertising
frame-decoration

Question

Consider a virtual memory system that uses First In First Out (FIFO) page replacement policy and it allocates a fixed number of frames to a process. Consider the following two statements,

1: Sometimes the page fault rate is increased if the number of page frames allocated is increased.
2: Some programs do not exhibit Locality of reference.

Which of the following is true?

a.

1 is false and 2 is true

b.

both 1 and 2 are false

c.

both 1 and 2 are true but 2 is not the reason for 1

d.

both 1 and 2 are true and 2 is the reason for 1

Answer: (c).both 1 and 2 are true but 2 is not the reason for 1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider a virtual memory system that uses First In First Out (FIFO) page replacement policy and it allocates a fixed number of frames to a process. Consider the following two...

Similar Questions

Discover Related MCQs

Q. Why do we translate a virtual address to physical address where a multilevel page table is preferred in comparison to a single level page table?

Q. What is the impact of thrashing?

Q. Memory utilization factor shall be computed as follows

Q. Which of the following is not a key piece of information, stored in single page table entry, assuming pure paging and virtual memory

Q. A set of techniques that allow to execute a program which is not entirely in memory is called

Q. Page fault frequency in an operating system is reduced when the

Q. Virtual memory can be implemented with

Q. A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a …………….

Q. Thrashing

Q. Which is not true about the memory management?

Q. In virtual memory systems, Dynamic address translation

Q. The principle of locality of reference justifies the use of

Q. Which of the following is not true about the memory management?

Q. Paging

Q. Under virtual storage,

Q. Virtual Memory

Q. Paging is implemented in

Q. Page-Table length register (PTLR) indicates size of

Q. Bring a page into memory only when it is needed is called

Q. Which of the following is not the approach to Handling Deadlocks