Virtual Memory

A process references five pages, A$,$ B$,$ C$,$ D$,$ and E$,$ in the following order:

A; B; C; D; A; B; E; A; B; C; D; E

Assume the replacement algorithm is first$-$in$-$first$-$out and find the number of page transfers

during this sequence of references starting with an empty main memory with three frames.

Repeat for four frames.

File System

Suppose there are $10$ disk addresses in the i$-$node, each $4$ bytes long, and the capacity

of each $($physical$)$ disk block is $2048$ B$.$

Calculate what the maximum file size can be in this case.