Q. Virtual Memory is commonly implemented by __________.

View solution

Q. Virtual memory is __________.

View solution

Q. _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory .

View solution

Q. The high paging activity is called ________.

View solution

Q. Virtual memory is __________.

View solution

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

View solution

Q. In a virtual memory environment

View solution

Q. The mechanism that bring a page into memory only when it is needed is called _____________

View solution

Q. Demand paged memory allocation

View solution

Q. What is a page fault ?

View solution

Q. Dirty bit is used to show

View solution

Q. Size of virtual memory depends on

View solution

Q. A program is executing in a pure demand paging system with 100 records per page with 1 free main memory frame. The address sequence that is generated by tracing this program is recorded as follows,
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370
What are the number of page faults?

View solution

Q. If hardware does not support _________ then a multi - user and multi - processing operating system cannot be implemented.

View solution

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 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?

View solution

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?

View solution

Q. What is the impact of thrashing?

View solution

Q. Memory utilization factor shall be computed as follows

View solution

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

View solution

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

View solution