Time Left - 10:00 mins
GATE 2020 : Operating System Quiz 9
Attempt now to get your rank among 545 students!
Question 1
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements:
P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate.
Q: Some programs do not exhibit locality of reference.
Which one of the following is TRUE?
P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate.
Q: Some programs do not exhibit locality of reference.
Which one of the following is TRUE?
Question 2
The virtual memory system uses the demand paging for its implementation. The probability of getting page faults is 0.25, the normal memory access time is 200 nanoseconds. If it takes 2 milliseconds to service a probability of page fault, then what is effective memory access time?
Question 3
A computer system with paging-based memory management, whose architecture allows for a 4GB virtual address space for processes. The size of logical pages and physical frames is 4KB. The system has 8GB of physical RAM. Assume that each page table entry requires an additional 10 bits (beyond the frame number) to store various flags. Assume page table entries are rounded up to the nearest byte. Consider the memory required for both outer and inner page tables.
Assuming the OS uses hierarchical paging, calculate the maximum memory space required to store the page table of a process in the system?
Assuming the OS uses hierarchical paging, calculate the maximum memory space required to store the page table of a process in the system?
Question 4
Consider a system having demand paged system, where integers are stored in 4 bytes, page size is 256 bytes.
consider the below program.
int a[] [] = new int [200] [200];
int i = 0;
int j = 0;
while (i + + < 200)
{
J = 0;
while(j++<200)
a[i][j] = 0
}
How many pages are needed to store the elements of an array?
(Assuming all elements of the array are stored in contiguous memory location?)
consider the below program.
int a[] [] = new int [200] [200];
int i = 0;
int j = 0;
while (i + + < 200)
{
J = 0;
while(j++<200)
a[i][j] = 0
}
How many pages are needed to store the elements of an array?
(Assuming all elements of the array are stored in contiguous memory location?)
Question 5
Consider the following information of virtual memory system
• 32-bit virtual address with single level paging
• First 20-bits are used for page number and remaining 12-bits are used for offset of the page.
• Each page table entry has 2 bytes information
• 100 MB of main memory
What is the page table size (in MB)?
• 32-bit virtual address with single level paging
• First 20-bits are used for page number and remaining 12-bits are used for offset of the page.
• Each page table entry has 2 bytes information
• 100 MB of main memory
What is the page table size (in MB)?
Question 6
Let there be system on which 2 level paging is applicable, There is a page table of it which has been separated into parts of 2K pages and every one of the pages have 4k entries and there is also given the Physical address size which is given to be 64mw which is then separated into 16 K frames the main memory (mm) is word addressable and page table entry size in both the level is 2w then Find out the first level page table size?
- 545 attempts
- 2 upvotes
- 3 comments
Apr 11GATE & PSU CS
