Bissoy.com
Doctors Medicines MCQs Q&A

The storage of 32 recently accessed page table entries to optimize the time, is known as

The storage of 32 recently accessed page table entries to optimize the time, is known as Correct Answer page table cache

To optimize the considerable time taken for conversion, a page table cache is provided, which stores the 32 recently accessed page table entries.

Related Questions

A, B and C are employed in a data entry job, such that A can fill 32 entries in 48 minutes, while B can fill 54 entries in 1. 5 hours. When a data entry work of filling 1000 entries was assigned to A, B and C together, 32 entries were still left to be filled after 8 hours. How many entries can C alone fill in an hour?
Which of the following are true statements? I: Primary storage units have faster access time and less storage capacity as compared to the secondary storage units. II: Primary storage units have sequential access. III: Secondary storage units are non-volatile storage.
In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is?
In the demand paging memory, a page table is held in registers. If it takes 1000 ms to service a page fault and if the memory access time is 10 ms, what is the effective access time for a page fault rate of 0.01?
What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid/invalid bit) and a page size of 512 bytes?
Suppose, you begin reading a book on page h and end on page k. If you read each page completely and the pages are numbered and read consecutively, then how many page shave you read?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used) 
Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?
Consider a main memory with 3 page frames in the following sequence of page reference 3, 4, 2, 3, 9, 1, 6, 3, 4, 9. What is the number of page fault using FIFO page replacement algorithm?