A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

Keep practicing — related questions

• Consider a FIFO page replacement algorithm containing three frames. Initially, there is no page loaded in a...
• A job has 3 pages A, B, C and the main memory has 2 page frames only. The job needs to process its pages in...
• A process has been allocated 3 page frames. Assume that none of the pages of the process are available in t...
• Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, i...
• Consider the virtual page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory s...
• Consider the following reference strings with three frames: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2,...
• Which of the following is/are the main causes of scarcity of water? (a) Over Exploitation of water. (b) Exc...
• In which of the following security policies, access is allowed if the object is requested in the same compa...