GATE Computer Science (CS) 2021 Shift 2 Solved Paper

© examsiri.com
Question : 40 of 65
 
Marks: +1, -0
Consider the following ANSI C code segment:
z = x + 3 + y -> f1 + y -> f2;
for (i = 0; i < 200; i = i + 2){
if (z > i) {
P = p + x + 3;
q = q + y -> f2;
} else {
p = p + y -> f2;
q = q + x + 3;
}
}

Assume that the variable y points to a struct (allocated on the heap) containing two fields f1 and f2, and the local variables x, y, z, p, g, and i are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code.The number of addition and dereference operations (of the form y -> f1 or y -> f2 ) in the optimized code, respectively, are:  
Go to Question: