Q. If all page frames are initially empty, and a process is allocated 3 page frames in real memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of page faults caused by the process will be __________.

View solution

Q. Replace the page that will not be used for the longest period of time. This principle is adopted by ____________.

View solution

Q. A page fault occurs

View solution

Q. Reference bit is used for

View solution

Q. The LRU algorithm

View solution

Q. Operating system supports different page replacement policy. From the given below option which is not a valid page replacement policy?

View solution

Q. In which of the following page replacement policies Belady’s anomaly occurs?

View solution

Q. The optimal page replacement algorithm will select the page that

View solution

Q. When size of the memory is increased the page replacement policy that sometimes leads to more page faults is called _________ .

View solution

Q. The average time of service a page fault is 10ms and the time taken to access the memory is 1µs. A 99.99% hit ratio results in average memory their access time is __________.

View solution

Q. A system that uses FIFO page replacement policy has 4 page frames with no pages loaded initially. 100 distinct pages are accessed by the system in some order and then the same 100 pages are accessed in the reverse order. How many page faults will occur?

View solution

Q. Match the following lists:

a. Gang scheduling ------------------------------- i. Guaranteed scheduling
b. Rate monotonic scheduling ------------------ ii. Real-time scheduling
c. Fair share scheduling ------------------------- iii. Thread scheduling

View solution

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

View solution

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

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. 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. What is page cannibalizing?

View solution

Q. ‘LRU’ page replacement policy is

View solution

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

View solution

Q. Page stealing

View solution