FOR FREE YEAR SOLVED
- 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
Question on Inverted Page Table
Question
A computer system, using inverted page table where Logical address space is 16MB and physical address space 8GB, and page size are 4KB. Memory is byte-addressable and page entry size is 8 bytes. What is the page table size?
(A) 16 KB
(B) 128 KB
(C) 16 MB
(D) 128 MB
Solution:
Please follow the previous chapter Inverted Page Table with examples before seeing the examples.
Inverted Page Table Size (PTS):
.png)
.png)
.png)
.png)
Because of inverted page table indexed by frame number so, the size of the inverted page table depends on the number of frames in main memory or physical memory.
So, Inverted Page Table Size = Number of frames × Page table entry
.png)
.png)
.png)
So, option (C) is correct.
Question
(MCQ)
Consider a paging system where the table contains page number and corresponding process id whereas frame number treated as an index of this table. This concept of the table in the paging system is called
(a) Page Table
(b) Frame Table
(c) Inverted Page Table
(d) Multi-process page table
Solution:
Please follow the previous chapter Inverted Page Table with examples before seeing the examples.
This is the concept of the inverted page table for more details please see chapter Inverted Page Table with examples.
Option (c) is correct.
