C Programming

#include <stdio.h>

main()
{
    int i;
    int *pi = &i;

    scanf("%d",pi);
    printf("%d\n", i+5);
}

Single correct

• ACompilation fails.
• BExecution results in a run-time error.
• COn execution, the value printed is 5 more than the address of variable i.
• DOn execution, the value printed is 5 more than the integer value entered.

int MyX(int *E, unsigned int size)
{
    int Y = 0;
    int Z;
    int i, j, k;

    for(i = 0; i < size; i++)
        Y = Y + E[i];

    for(i = 0; i < size; i++)
        for(j = i; j < size; j++)
        {
            Z = 0;
            for(k = i; k <= j; k++)
                Z = Z + E[k];
            if (Z > Y)
                Y = Z;
        }
    return Y;
}

Single correct

• Amaximum possible sum of elements in any sub-array of array E.
• Bmaximum element in any sub-array of array E.
• Csum of the maximum elements in all possible sub-arrays of array E.
• Dthe sum of all the elements in the array E.

int func(int num) {
    int count = 0;
    while (num) {
        count++;
        num>>= 1;
    }
    return (count);
}

Numerical answer

Single correct

• Ap = n * (n-1) * (n-2) / 6;
• Bp = n * (n-1) / 2 * (n-2) / 3;
• Cp = n * (n-1) / 3 * (n-2) / 2;
• Dp = n * (n-1) * (n-2) / 6.0;

int f(int j)
{
    static int i = 50;
    int k;
    if (i == j)
    {
        printf("something");
        k = f(i);
        return 0;
    }
    else return 0;
}

Single correct

• AThe function returns 0 for all values of j.
• BThe function prints the string something for all values of j.
• CThe function returns 0 when j = 50.
• DThe function will exhaust the runtime stack or run into an infinite loop when j = 50.

Numerical answer

int ProcessArray(int *listA, int x, int n)
{
    int i, j, k;
    i = 0;
    j = n-1;
    do {
        k = (i+j)/2;
        if (x <= listA[k])
            j = k-1;
        if (listA[k] <= x)
            i = k+1;
    }while (i <= j);

    if (listA[k] == x)
        return(k);
    else
        return -1;
}

Single correct

• AIt will run into an infinite loop when x is not in listA.
• BIt is an implementation of binary search.
• CIt will always find the maximum element in listA.
• DIt will return −1 even when x is present in listA.