Computer Science · Operating Systems
A process references 5 pages A, B, C, D, and E in the order: A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm used is FIFO (First-In-First-Out), find the number of page faults that occur with an initially empty memory allocation of 3 frames.
- 110
- 29✓
- 38
- 47
Correct answer
9
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems