Section II$.$ Short Answer$/$Problems$.$ Answer the following questions on the provided scratch paper. Clearly

indicate to which problem your answer corresponds. NO CALCULATORS ALLOWED.

For these problems, use a system with a page size of $8$ K $,$ a virtual memory size of $64$ GB $,$ and $4$ MB of physical

memory.

$8$

$($a$)(9$ points$)$ The page table for a process in the above system has the following entries:

Presume all other page table entries are invalid, please mark them as such.

Convert the following addresses to their corresponding physical address.

a$.0001000001000001$

b$.1110011110000001$

c$.0110001111111001$

$($b$)(16$ points$)$ What is the size of the page table required to map a process with the above specifications?

Be sure to clearly label your final answer.

$($c$)(6$ points$)$ How much memory does a single frame worth of page table entries "cover"? Be sure to

clearly label your final answer.

$($d$)(14$ points$)$ Presume that a process has $256$ MB of code$/$data$/$heap and $320$MB of stack. How many

frames for both page tables are required if the page table in question $11(b)$ is allocated a second level

page table? Be sure to clearly label your final answer.

$($e$)(16$ points$)$ The memory system described in question $11($d$)$ has an $55$ ns access time and utilizes a $5$ ns

cache. What is the average memory access time if the cache has a $70\%$ hit rate? Just the formula, with

the appropriate values plugged in$,$ is sufficient.