Suppose for a process P, reference to pages in order are (1,2,4,5,2,1,2,4). Assume that main memory can accomodate 3 pages and the main memory has already pages 1 and 2 in the order 1 - first, 2 - second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process P is
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 5
Explanation
Frames hold 1, 2 (one free). 1, 2 hit; 4 fault (1, 2, 4); 5 fault, evict 1; 2 hit; 1 fault, evict 2; 2 fault, evict 4; 4 fault, evict 5. Total 5 faults.
More System Software and Operating System questions
- Consider the following processes with CPU burst times in milliseconds (table below). The processes are scheduled with Round-Robin schedulin…
- Suppose P, Q, and R are cooperating processes satisfying Mutual Exclusion conditions. Then, if Q the process is executing in its critical s…
- A process residing in Main Memory and Ready and Waiting for execution is kept on?
- ______ system call creates new process in Unix.
- At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on t…
- In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required…