The function f(int x, int y) takes two integer arguments x and y. It uses a for loop that iterates y times. Inside the loop, the value of x is updated using the expression x = x + x + y. Analyzing Statements: (A) If the inputs are x=20, y=10, then the return value is greater than 220 Let's simulate the function call with x = 20 and y = 10: Iteration 1: x = 20 + 20 + 10 = 50 Iteration 2: x = 50 + 50 + 10 = 110 ... (similar updates in every iteration) Iteration 10 (assuming y = 10): x = ... + ... + 10 = ~210 (The exact value will be slightly higher than 210) Therefore, statement (A) is False. The return value is likely around 210, not greater than 220. (B) If the inputs are x=20, y=20, then the return value is greater than 220 Similar to (A), with y = 20, the final value of x will be significantly higher than 220. Statement (B) is True. (C) If the inputs are x=20, y=10, then the return value is less than 210 As shown in the analysis of (A), the return value is around 210. Statement (C) is False. (D) If the inputs are x=10, y=20, then the return value is greater than 220 With x = 10 and y = 20, the final value of x will be even higher than in (B). Statement (D) is True.

///////////////////////////////// PROGRAM
#include
int main()
{
float sum= 0.0, j=1.0, i=2.0;
while(i/j > 0.0625)
{
j = j+j;
sum = sum+i/j;
printf("%f\n",sum);
}
return 0;
}
//////////////////////////////////OUTPUT
1.000000
1.500000
1.750000
1.875000
1.937500

///////////////////////////PROGRAM
#include
int r()
{
int x;
static int num=7;
x =num--;
printf("num--: %d\n",x);
return x;
}
int main()
{
for(r(); r(); r())
{
printf("%d\n", r());
}
return 0;
}
//////////////////////////////OUTPUT
num--: 7
num--: 6
num--: 5
5
num--: 4
num--: 3
num--: 2
2
num--: 1
num--: 0

///////////////////////////////////PROGRAM
#include
int main()
{
int a[] = {2,4,6,8,10};
int i, sum = 0, *b = a+4;
for(i=0; i<5; i++)
{ printf("*b, (*b-i): %d , %d\n",*b, (*b-i) );
printf("*(b-i): %d\n",*(b-i) );
printf("sum = %d + %d - %d\n",sum, (*b-i),*(b-i));
sum = sum + (*b-i) - *(b-i);
printf("sum = %d\n", sum);
}
printf("%d\n", sum);
return 0;
}
//////////////////////////////OUTPUT
*b, (*b-i): 10 , 10
*(b-i): 10
sum = 0 + 10 - 10
sum = 0
*b, (*b-i): 10 , 9
*(b-i): 8
sum = 0 + 9 - 8
sum = 1
*b, (*b-i): 10 , 8
*(b-i): 6
sum = 1 + 8 - 6
sum = 3
*b, (*b-i): 10 , 7
*(b-i): 4
sum = 3 + 7 - 4
sum = 6
*b, (*b-i): 10 , 6
*(b-i): 2
sum = 6 + 6 - 2
sum = 10
10

do-while loop in C is always executed at least once, because in this control structure first the loop is executed and then condition is checked ,which is not the case in for loop or while loop.

Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code.
The complexity M is then defined as
M = E − N + 2P,
where
E = the number of edges of the graph.
N = the number of nodes of the graph.
P = the number of connected components.