Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Recall that Belady’s anomaly is that the page-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?
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?
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
Consider the following page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Assume that there are three-page frames which are initially empty. Let LRU, FIFO, OPTIMAL denote the number of page faults under the corresponding page replacement strategy. Then, which of the following is TRUE?
How many page faults will occur if Optimal 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
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) 
Consider a main memory with 3 page frames in the following sequence of page reference 3, 4, 2, 3, 9, 1, 6, 3, 4, 9. What is the number of page fault using FIFO page replacement algorithm?
Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For Optimal page replacement algorithms with 3 frames, the number of page faults is?
Match List I with List II List I List II (A) Greedy Best-First Search (I) Space complexity is O(d) where d = depth of the deepest optimal solution (B) A* (II) Incomplete even if the search space is finite. (C) Recursive Best-First Search (III) Optimal if optimal solution is reachable: otherwise, returns the best reachable optimal solution. (D) SMA* (IV) Computation and space complexity is too high.   Choose the correct answer from the options given below:
In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?