paging $-1$

Problem XVI: In a simple page$-$based virtual memory, with a linear page table, assume the following:

virtual address space size is $128$ bytes $($small$!)$

physical memory size of $1024$ bytes $($small$!)$

page size of $16$ bytes

The format of the page table: The high$-$order $($leftmost$)$ bit is the VALID bit. If the bit is $1,$ the rest of the entry is the PFN$.$

If the bit is $0,$ the page is not valid.

Here are the contents of the page table $($from entry $0$ down to the max size$)$

$[0]080000034$

$[1]000000000$

$[2]000000000$

$[3]000000000$

$[4]08000001e$

$[5]080000017$

$[6]080000011$

$[7]08000002e$

Which of the following virtual addresses are valid?

To answer: Fill in A for valid virtual accesses, B for non$-$valid accesses.

$76.034($decimal: $52)$

$77.044($decimal: $68)$

$78.057($decimal: $87)$

$79.018($decimal: $24)$

$80.046($decimal: $70)$