Consider that a process has been allocated 3 frames and has a sequence of page referencing 1, 2, 1, 3, 7, 4, 5, 6, 3, 1 as . What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 2
Explanation
With 3 frames, LRU faults 9 times on 1, 2, 1, 3, 7, 4, 5, 6, 3, 1; optimal faults 7 times (3 and 1 hit at the end). Difference 2.
More System Software and Operating System questions
- Consider three CPU intensive processes, which require 10,20 and 30 units of time and arrive at times 0,2 and 6 respectively. How many conte…
- At a particular time of computation, the value of a counting semaphore is 7. Then 20 P (wait) operations and 15 V (signal) operations are c…
- The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
- A computer has six tape drives with (n) processes competing for them. Each process may need two drives. What is the maximum value of (n) fo…
- Which of the following UNIX/Linux pipes will ⋅c count the number of lines in all the files having h and as their extension in the current w…
- Which of the following statement/s is/are true? (i) Windows XP supports both peer-peer and client-server networks. (ii) Windows XP implemen…