Consider the following C program:
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 \]

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).


Consider the following C program:
Consider the following C code segment: 
The output of the given C code segment is __________. (Answer in integer)
Consider the following C program:
The output of the above program is __________ . (Answer in integer)
Consider the following C program:
Consider the following C program: