Q$1)$ points$]$

A paging system uses $16-$byte pages and logical address space has $256$ different addresses. The physical memory is $2K$ bytes, the page table and the logical memory is given below.

Find physical memory addresses for each lettec $a,b$ and $c.$

Here the system uses frame size as $2$ times the page size, which means that for a page $p,p$ and $(p+1)$ will be stored at frame $(p+1),$ as given below, Be careful on page offset settings, and you might need to make a change here in the offset side while performing address translation.

$\backslash$table$[[$Logical$-$memory,page$-$table$],[5a,(p+1),],[13b,]]$

Q$2)[40$ points$]$

Below a page reference striag is given. Initially we have an empty memory of $4-$bins.

$40$ points

This time a new Virtual Memory demand paging algorithm is given:

Most$-$Recently Used $($MRU$),$ which selects the opposite of LRU.

Find the number of page$-$faults for MRU and LRU algorithms, and compare which one is better.