The __________ is used as an index into the page table.

• A. Frame bit
• B. Page number
• C. Page offset
• D. Frame offset

The _____ table contains the base address of each page in physical memory.

• A. Process
• B. Memory
• C. Page
• D. Frame

The size of a page is typically ____________

• A. Varied
• B. Power of 2
• C. Power of 4
• D. None of the mentioned

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.

• A. M, n
• B. N, m
• C. M €? n, m
• D. M €? n, n

With paging there is no ________ fragmentation.

• A. Internal
• B. External
• C. Either type of
• D. None of the mentioned

Paging increases the ______ time.

• A. Waiting
• B. Execution
• C. Context €? switch
• D. All of the mentioned

Smaller page tables are implemented as a set of _______

• A. Queues
• B. Stacks
• C. Counters
• D. Registers

The page table registers should be built with _______

• A. Very low speed logic
• B. Very high speed logic
• C. A large memory space
• D. None of the mentioned

For larger page tables, they are kept in main memory and a __________ points to the page table.

• A. Page table base register
• B. Page table base pointer
• C. Page table register pointer
• D. Page table base

For every process there is a __________

• A. Page table
• B. Copy of page table
• C. Pointer to page table
• D. All of the mentioned