CREATE OWN LIBRARY
- 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
Sample Questions
1. Most Frequently Used (MFU) and Least Frequently Used (LRU) is not commonly as page replacement algorithm because ________________________
(A) Both are expensive
(B) Both are not Optimal
(C) Implementation is not practical
(D) None of these
Solution:
Option (A) and (B) are correct.
Explanation:
Neither MFU nor LFU replacement is commonly used. The implementation of these algorithms is expensive, and they do not approximate optimal replacement well.
For more please follow: Some other page replacement algorithm.
2. Which is data-structure is suitable for the second chance page replacement algorithm
(A) Stack using linked list
(B) Queue using linked list
(C) Queue using circular linked list
(D) None of the above
You should Know
Before seeing the solutions please follow this chapter:
Second Chance page replacement algorithm, Some other page replacement algorithm.
Solution:
Option (C) is correct.
Explanation:
If we used a linked list to implement second chance algorithm (modified version of FIFO), it requires extra time for it. So, unnecessarily extra time needed because it is constantly moving pages around on its list.
To overcome it, we can use a circular queue (using a linked list)in the form of a clock. A pointer (that is, a hand on the clock) indicates which page is to be replaced next.
