The percentage of times a page number is found in the TLB is known as                          

Related MCQs

• If a page number is not found in the TLB, then it is known as a                          
• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset.
• Each entry in a translation lookaside buffer (TLB) consists of                          
• In question 2, if the number of page frames is increased to 4, then the number of page transfers                          
• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• For larger page tables, they are kept in main memory and a                      points to the page table.
• In FIFO page replacement algorithm, when a page must be replaced                          
• A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is                          
• LRU page – replacement algorithm associates with each page the              
• A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because