Consider a process generates the page reference string: 2,
3, 6, 3, 2, 7, 2, 3, 6, 7, 2, 3, 2, 6, 3,
7. This process has 3 frames allocated to it.
What is the number of page faults for First In First Out (FIFO)
page replacement algorithm?
Consider a process generates the page reference string: 2, 3, 6, 3, 2, 7, 2, 3, 6, 7, 2, 3, 2, 6, 3, 7. This process has
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Consider a process generates the page reference string: 2, 3, 6, 3, 2, 7, 2, 3, 6, 7, 2, 3, 2, 6, 3, 7. This process has
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!