A system uses FIFO policy for page replacement. It has $$4$$ pages frames with no pages loaded to begin with. The system first accesses $$100$$ distinct pages in some order and then accesses the same $$100$$ pages but now in the reverse order. How many page faults will occur?

In which one of the following page replacement policies, Belady’s anomaly may occur?

How many $$32K\,\, \times \,\,1RAM$$ chips are needed to provide a memory capacity of $$256$$ $$K$$-bytes?

The essential content(s) in each entry of a page table is / are: