⌘K
Flycodx

Page Replacement Algorithms

Page Replacement Algorithms

MediumOperating System0% accepted

Given a reference string and number of frames, compute page faults for FIFO, LRU, and Optimal page replacement algorithms. Explain Belady's anomaly.

Approach

Compare FIFO, LRU, Optimal page replacement; compute page faults.

Input

Frames=3, Ref string: 7 0 1 2 0 3 0 4 2 3 0 3 2, FIFO

Output

12 page faults

Scenarios & Expected Answers

Sign in to continue

Create a free account to view answers and mark progress.

  • Free forever — no credit card
  • Theory Q&A with detailed answers
  • Points, streaks & leaderboards
Auto Save On