FOR FREE CONTENT
- Introduction: OS
- Booting Process
- Command Interpreter
- Dual mode of operation
- System Calls
- Difference between system call and library call
- Interrupt and Trap
- Introduction
- Scheduling Criteria, Terms and Concepts
- Different Type Scheduling Algorithms
- Longest Job First
- Longest Remaining Time First
- Highest Response Ratio Next (HRRN)
- Priority Scheduling
- Least Completed Next (LCN) Scheduling
- Multi-Level Queue Scheduling
- Multilevel Feedback Queue Scheduling
- Guaranteed Scheduling
- Fair Share Scheduling
- Lottery Scheduling
- Multi-Processor Scheduling
- Deadline Scheduling
- Rate-Monotonic Scheduling
- POSIX Real-Time Scheduling
- Priority Inversion
- Proportional Share Scheduling
- Comparison table of Scheduling Algorithm
- Algorithm Evaluation for Scheduling
- Important concept of MM
- Memory Representation as Address
- Memory layout for a Process
- Logical and Physical Address Space
- Necessity of Memory Management
- Introduction
- Concept of Non-contiguous memory allocation
- Basic concept of Paging
- Address Translation
- Process of Paging Method
- Calculation of Offset for paging
- Calculation of Logical Address Bit and number of Pages
- Calculation of Physical Address Bit and number of Frames
- Calculation of Page Table Size
- Organization of MMU
- Why Page size power of 2
- Paging Address Calculation: example1
- Paging Numeric Problem: Example2
- Paging Address Calculation: Example3
- Paging Address Calculation: Question1
- Some Important Question 2
- Paging Address Translation: Question3
- UGC NET Paging Question
- GATE Paging Question
- Number of information at Page Entry
- Exams Question on Page Entry Information
- Exam Question: Page Entry Information
- Calculates Page Table Entry Size
- Calculates Page Size
- Calculation of Optimal Page Size
- Question on Optimal Page Size
- Hashed Page Table with Example
- Inverted Page Table with Gate Question
- Question on Inverted Page Table
- Multi-Level Paging
- Multi-level paging: Example1
- Multi-level paging: Example2
- Allocation of Frames
- Subject Mock
GATE question on Optimal algorithm
Q. GATE 2014-SET 2-Q33
Assume that there are 3 frames that are initially empty. If the page reference string is
1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6 the number of page fault using the optimal replacement policy is______.
Answer is number of page faults: 7
You should know:
Before seeing the solution please follow the previous chapter:
Optimal Page Replacement algorithm.
Solution and explanation:
Given page references: 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6
.png)
.png)
Number of page faults is 7.
Shortcut method:
But in examination it is not possible to solve it by this elaborative way we can do it by a single frame like below:
.png)
The above process is a shortcut and the easiest process to calculate page faults.
So, the number of page faults is 7.
To know more about how the page is replacing here by optimal page replacement policy please follow the previous chapter: Optimal Page Replacement algorithm.
