Q. In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?

View solution

Q. The problem of thrashing is affected significantly by:

View solution

Q. In which of the storage placement strategies a program is placed in the largest available hole in the main memory?

View solution

Q. If the number of bits in a virtual address of a program is 16 and the page size is 0.5 K bytes, the number of pages in the virtual address space is

View solution

Q. Which of the following statements is false?

View solution

Q. The memory allocation scheme subject to "external" fragmentation is

View solution

Q. Fragmentation of the file system

View solution

Q. Thrashing can be avoided if

View solution

Q. Which of the following statements is false ?

View solution

Q. With …………………. A page is written out to secondary memory only when it has been selected for replacement.

View solution

Q. The ……………. Determines when a page should be brought into main memory.

View solution

Q. Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements:
S1: Random page replacement algorithm (where
a page chosen at random is replaced)
suffers from Belady’s anomaly.

S2: LRU page replacement algorithm suffers
from Belady’s anomaly .
Which of the following is CORRECT?

View solution

Q. Page stealing

View solution

Q. Which amongst the following is not a valid page replacement policy ?

View solution

Q. ‘LRU’ page replacement policy is

View solution

Q. What is page cannibalizing?

View solution

Q. We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
If Optimal Page Replacement policy is used, _______ page faults will occur for the above reference string.

View solution

Q. We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?

View solution

Q. Which of the following statements is true for the dirty page in a page table?

View solution

Q. Which page is selected by the Optimal Page Replacement Algorithm?

View solution