Part $1$

Consider a central memory M$1$ consisting of $2$ frames and a secondary memory M$2.$ Let P $=1213124134$ the reference string to pages $1,2,3,4,$ initially located in M$2.$ Using demand paging to move the pages from M$2$ to M$1,$ calculate the following:

Note: We define the success rate s as follows: s $=1-($F $/$ L$)$ where F is the number of page faults and L is the length of the reference string P

$1.$ How many page faults occur for the reference string P$,$ when using FIFO replacement page algorithm?

Fill in the table below $[1$ Points$]$

$1213124134$

F$1$

F$2$

p$.$f

Total Number of Page Faults: $\_\_\_\_\_\_?[0\mathrm{.}5$ Point$]$ Success Rate: $\_\_\_\_\_\_\_\_[0\mathrm{.}5$ Point$]$

$2.$ Repeat using the LRU strategy.

Fill in the table below $[1$ Points$]$

$1213124134$

F$1$

F$2$

p$.$f

Total Number of Page Faults: $\_\_\_\_\_\_?[0\mathrm{.}5$ Point$]$ Success Rate: $\_\_\_\_\_\_\_\_[0\mathrm{.}5$ Point$]$

$3.$ Repeat using the Optimal strategy.

Fill in the table below $[1$ Points$]$

$1213124134$

F$1$

F$2$

p$.$f

Total Number of Page Faults: $\_\_\_\_\_\_?[0\mathrm{.}5$ Point$]$ Success Rate: $\_\_\_\_\_\_\_\_[0\mathrm{.}5$ Point$]$

Part $2$

Consider a central memory M$1$ consisting of $3$ frames and a secondary memory M$2.$ Let P $=1213124134$ the reference string to pages $1,2,3,4,$ initially located in M$2.$ Using demand paging to move the pages from M$2$ to M$1,$ calculate the following:

$1.$ How many page faults occur for the reference string P$,$ when using FIFO replacement page algorithm?

Fill in the table below $[1$ Points$]$

$1213124134$

F$1$

F$2$

F$3$

p$.$f

Total Number of Page Faults: $\_\_\_\_\_\_?[0\mathrm{.}5$ Point$]$ Success Rate: $\_\_\_\_\_\_\_\_[0\mathrm{.}5$ Point$]$

$2.$ Repeat using the LRU strategy.

Fill in the table below $[1$ Points$]$

$1213124134$

F$1$

F$2$

F$3$

p$.$f

Total Number of Page Faults: $\_\_\_\_\_\_?[0\mathrm{.}5$ Point$]$ Success Rate: $\_\_\_\_\_\_\_\_[0\mathrm{.}5$Point$]$