numbers are from $0$ to $15).$ Suppose the process A has $4$ pages. The page numbers are $0,1,2,$ and $3,$

which are loaded to frame $9,0,1,$ and $14,$ respectively.

$($i$)[2$ marks$]$

What is the length of process A$?$

$($ii$)[4$ marks$]$

For logical addresses $0001000001001000$ and $0011000001100011($all logical addresses are

binary values$),$ convert them to the physical address in the main memory.

B$)[6$ marks$]$

Suppose three page frames are assigned to a process and they are initially empty. Before the frame

allocation is initially filled, all first unique pages are also counted as page faults.

Complete the table below if we use the CLOCK replacement algorithm. The first row of the table is

the request sequence. Your table should show the page number in each frame after each reference.

Use a $-$ to indicate that a frame is empty. In the last row of the table, mark an $$F$$ for each page

reference that results in a page fault $($if there is no page fault, leave it blank$).$ Use a $*$ right next to

the page number to indicate that the corresponding use bit is equal to $1.$ Use an arrow $$ in the

corresponding frame to indicate the current position of the next frame pointer.