The overlay tree for a program is as shown below:

What will be the size of the partition (in physical memory) required to load (and run) this program?

If an instruction takes $${\rm I}$$ microseconds and a page fault takes an additional $$j$$ microseconds, the effective instruction time if on the average a page fault occurs every $$k$$ instruction is:

A $$1000$$ Kbyte memory is managed using variable partitions but to compaction. It currently has two partitions of sizes $$200$$ Kbytes and $$260$$ Kbytes respectively. The smallest allocation request in Kbytes that could be denied is for

The address sequence generated by tracing a particular program executing in a pure demand paging system with $$100$$ records per page with $$1$$ free main memory frame is recorded as follows. What is the number of page faults?

$$0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370 $$