## LRU Approximation Page Replacement Algorithm

Q1. Explain LRU Approximation Page Replacement Algorithm. Ans. Few computer systems provide sufficient hardware support for true LRU page replacement. Many

## Numerical To Calculate Physical Address

Q1. Consider the following segment table: Segment Base Length Logical Address 0 219 600 430 1 2300 14 10 2

## Numerical-II Solved For Belady’s Anomaly Problem

Q2. The reference string is: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. Solve it with

## Numerical For Belady’s Anomaly Problem

Q1. If the reference string is 0 1 2 3 0 1 4 0 1 2 3 4 then solve by

## Numerical Solved by Least Recently Used Page Replacement Algorithm

Q1. If the reference string is 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, we have

## Least Recently Used Page Replacement Algorithm

Q1. Explain Least Recently Used Page Replacement Algorithm. Ans. This kind of technique includes the removal of those pages which has not

## Counting Based Algorithm

Q1. What are the types of Counting Based Algorithm? Ans. Following are the types of Counting Based Algorithm: LRU (Least Recently