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

• A. Miss ratio
• B. Hit ratio
• C. Miss percent
• D. None of the mentioned

Memory protection in a paged environment is accomplished by ____________

• A. Protection algorithm with each page
• B. Restricted access rights to users
• C. Restriction on page visibility
• D. Protection bit with each page

When the valid – invalid bit is set to valid, it means that the associated page ____________

• A. Is in the tlb
• B. Has data in it
• C. Is in the process’s logical address space
• D. Is the system’s physical address space

Illegal addresses are trapped using the _____ bit.

• A. Error
• B. Protection
• C. Valid €? invalid
• D. Access

When there is a large logical address space, the best way of paging would be ____________

• A. Not to page
• B. A two level paging algorithm
• C. The page table itself
• D. All of the mentioned

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?

• A. 3.0 ns
• B. 68.0 ns
• C. 68.5 ns
• D. 78.5 ns

In paged memory systems, if the page size is increased, then the internal fragmentation generally ____________

• A. Becomes less
• B. Becomes more
• C. Remains constant
• D. None of the mentioned

When using counters to implement LRU, we replace the page with the ____________

• A. Smallest time value
• B. Largest time value
• C. Greatest size
• D. None of the mentioned

In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________

• A. Whenever a page is used, it is removed from the stack and put on bottom
• B. The bottom of the stack is the lru page
• C. The top of the stack contains the lru page and all new pages are added to the top
• D. None of the mentioned

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

• A. Queue algorithms
• B. Stack algorithms
• C. String algorithms
• D. None of the mentioned