Question

Consider the following C program:

Hint:

Trace function calls carefully by evaluating inner functions first.

Answer 1

The execution of the program proceeds as follows: 
Step 1: Understanding function calls - Function \( f(n) \) calls \( g(n*2) \), which returns \( (n*2 + 10) \). - Function \( g(x) \) returns \( (x + 10) \).
Step 2: Iteration through the loop For \( n = 1 \): \[ f(1) = g(1 \times 2) = g(2) = 2 + 10 = 12 \] \[ g(f(1)) = g(12) = 12 + 10 = 22 \] \[ {sum} = 22 \] For \( n = 2 \): \[ f(2) = g(2 \times 2) = g(4) = 4 + 10 = 14 \] \[ g(f(2)) = g(14) = 14 + 10 = 24 \] \[ {sum} = 22 + 24 = 46 \]