Given the code below, this method call:
Emta.caeLomal();
...will eventually reach the point marked HERE. Draw a diagram of the stack and the heap at that point.
(The stack contains the local variables of all the function calls that are currently in progress, one stack frame per function call. The heap contains all of the objects that currently exist.)
In your diagram:
this parameter if present. (You do not need to write the types of any variables.)The code:
public class Emta {
private int iasli;
Emta(int iasli) {
this.iasli = iasli;
}
public static void ichas(Squl ro, Emta pri, Squl ta) {
ta.setDuid(pri);
HERE;
}
public static void caeLomal() {
Squl proe = new Squl(481);
Emta.ichas(proe, new Emta(440), proe);
new Squl(637).osrent(new Squl(891), proe);
}
}
public class Squl {
private int binte;
private Emta duid;
Squl(int binte) {
this.binte = binte;
}
public void setDuid(Emta duid) {
this.duid = duid;
}
public void osrent(Squl sa, Squl osbu) {
}
}
Hints for practicing this puzzle:
Related puzzles: