2k views

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?

1. $\text{12 KB}$
2. $\text{14 KB}$
3. $\text{10 KB}$
4. $\text{8 KB}$
edited | 2k views

"To enable a process to be larger than the amount of memory allocated to it, we can use overlays. The idea of overlays is to keep in memory only those instructions and data that are needed at any given time. When other instructions are needed, they are loaded into space occupied previously by instructions that are no longer needed." For the above program, maximum memory will be required when running code portion present at leaves. Max requirement $=$ (max of requirements of $D,E,F$, and $G$. $=MAX( 12,14,10,14) =14$ (Answer)

edited
traverse this as depth first left to right. when we visit a node for first time, it is loaded in main memory and when we visit it for last time, it is pulled out. so max size will be needed when we pull out D and load E in the main memory which is 14 KB.
DF travelling the tree, we find Root->A->E & Root->C->G have the maximum weights (2+4+8=14) & (2+8+4=14) respectively.

Ans :B
0

Hi @Pronomita Dey 1 ji,