Ask Question
30 December, 20:47

Suppose you have a 16-bit machine with a page size of 16B. Assume that any unsigned 16-bit integer can be a memory address. Also, assume that the machine can support up to only 32KB of physical memory. (1K = 210)

Required:

For paging-based memory allocation, how many page table entries do you need to map the virtual address space of a process, with pure paging alone?

+2
Answers (1)
  1. 30 December, 23:49
    0
    2^11

    Explanation:

    Physical Memory Size = 32 KB = 32 x 2^10 B

    Virtual Address space = 216 B

    Page size is always equal to frame size.

    Page size = 16 B. Therefore, Frame size = 16 B

    If there is a restriction, the number of bits is calculated like this:

    number of page entries = 2^[log2 (physical memory size) - log2 (n bit machine) ]

    where

    physical memory size = 32KB which is the restriction

    n bit machine = frame size = 16

    Hence, we have page entries = 2^[log2 (32*2^10) - log2 (16) ] = 2ˆ[15 - 4 ] = 2ˆ11
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Suppose you have a 16-bit machine with a page size of 16B. Assume that any unsigned 16-bit integer can be a memory address. Also, assume ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers