C Programming

Consider the following ANSI C program.

#include <stdio.h>
int main()
{
    int i, j, count;
    count = 0;
    i = 0;
    for (j = -3; j <= 3; j++)
    {
        if ((j >= 0) && (i++))
            count = count + j;
    }
    count = count + i;
    printf("%d", count);
    return 0;
}

Which one of the following options is correct?

Consider the following ANSI C function:

int SimpleFunction(int Y[], int n, int x)
{
  int total = Y[0], loopIndex;
  for (loopIndex = 1; loopIndex <= n - 1; loopIndex++)
       total = x * total + Y[loopIndex];
  return total;
}

Let Z be an array of 10 elements with Z[$i$]=1, for all $i$ such that $0 le i le 9$. The value returned by SimpleFunction(Z, 10, 2) is __________.

Consider the following ANSI C program.

#include <stdio.h>
int main(){
  int arr[4][5];
  int i, j;
  for (i=0; i<4; i++){
    for (j=0; j<5; j++){
      arr[i][j] = 10*i + j;
    }
  }
  printf("%d", *(arr[1] + 9));
  return 0;
}

What is the output of the above program?

Consider the following ANSI C function:

int SomeFunction(int x, int y)
{
  if ((x == 1) || (y == 1)) return 1;
  if (x == y) return x;
  if (x > y) return SomeFunction(x - y, y);
  if (y > x) return SomeFunction(x, y - x);
}

The value returned by SomeFunction(15, 255) is __________.

Consider the following ANSI C program:

#include <stdio.h>
#include <stdlib.h>
struct Node{
        int value;
        struct Node *next;};
int main(){
    struct Node *boxE, *head, *boxN; int index = 0;
    boxE = head = (struct Node *) malloc(sizeof(struct Node));
    head->value = index;
    for (index = 1; index <= 3; index++){
        boxN = (struct Node *) malloc(sizeof(struct Node));
        boxE->next = boxN;
        boxN->value = index;
        boxE = boxN; }
    for (index = 0; index <= 3; index++) {
        printf("Value at index %d is %d\n", index, head->value);
        head = head->next;
        printf("Value at index %d is %d\n", index+1, head->value); } }

Which one of the statements below is correct about the program?

Consider the following ANSI C program.

#include <stdio.h>

int foo(int x, int y, int q)
{
    if ((x <= 0) && (y <= 0))
        return q;
    if (x <= 0)
        return foo(x, y-q, q);
    if (y <= 0)
        return foo(x-q, y, q);
    return foo(x, y-q, q) + foo(x-q, y, q);
}

int main()
{
    int r = foo(15,15,10);
    printf("%d", r);
    return 0;
}

The output of the program upon execution is ________.

Consider the C code fragment given below.

typedef struct node {
  int data;
  node* next;
} node;

void join(node* m, node* n){
  node* p = n;
  while(p->next != NULL) {
    p = p->next;
  }
  p->next = m;
}

Assuming that m and n point to valid NULL-terminated linked lists, invocation of join will

Consider the following C code:

#include <stdio.h>
int *assignval(int *x, int val) {
      *x = val;
      return x;
}

void main () {
      int *x = malloc(sizeof(int));
      if(NULL == x) return;
       x = assignval(x,0);
       if(x) {
             x = (int *)malloc(sizeof(int));
             if(NULL == x) return;
             x = assignval(x,10);
       }
      printf("%d\n", *x);
      free(x);
}

The code suffers from which one of the following problems:

Consider the following two functions.

void fun1(int n) {                void fun2(int n) {
        if(n == 0) return;                if(n == 0) return;
        printf("%d", n);                  printf("%d", n);
        fun2(n - 2);                      fun1(++n);
        printf("%d", n);                  printf("%d", n);
}                                   }

The output printed when fun1(5) is called is

Consider the C functions foo and bar given below:

int foo(int val) {
    int x = 0;
    while(val > 0) {
        x = x + foo(val--);
    }
    return val;
}

int bar(int val) {
    int x = 0;
    while(val > 0) {
        x = x + bar(val-1);
    }
    return val;
}

Invocations of foo(3) and bar(3) will result in:

Consider the following C program.

#include <stdio.h>
#include <string.h>

void printlength(char *s, char *t) {
   unsigned int c = 0;
   int len = ((strlen(s) - strlen(t)) > c) ? strlen(s): strlen(t);
   printf("%d\n", len);
}

void main() {
   char *x = "abc";
   char *y = "defgh";
   printlength(x,y);
}

Recall that strlen is defined in string.h as returning a value of type size_t, which is an unsigned int. The output of the program is ________.

The output of executing the following C program is ________.

#include <stdio.h>

int total(int v) {
    static int count = 0;
    while(v) {
        count += v&1;
        v >>= 1;
    }
    return count;
}

void main() {
    static int x = 0;
    int i = 5;
    for(; i > 0; i--) {
        x = x + total(i);
    }
    printf("%d\n", x);
}

Match the following:

(P) static char var;          (i)   Sequence of memory locations to store addresses
(Q) m = malloc(10);           (ii)  A variable located in data section of memory
    m = NULL;
(R) char *ptr[10];            (iii) Request to allocate a CPU register to store data
(S) register int var1;        (iv)  A lost memory which cannot be freed

Consider the following function implemented in C:

void printxy(int x, int y) {
       int *ptr;
       x = 0;
       ptr = &x;
       y = *ptr;
       *ptr = 1;
       printf("%d,%d",x,y);
}

The output of invoking printxy(1,1) is

Consider the C program fragment below which is meant to divide x by y using repeated subtractions. The variables x, y, q and r are all unsigned int.

while (r >= y) {
   r = r - y;
   q = q + 1;
}

Which of the following conditions on the variables x, y, q and r before the execution of the fragment will ensure that the loop terminates in a state satisfying the condition x == (y*q + r)?

Consider the following snippet of a C program. Assume that swap(&x, &y) exchanges the contents of x and y.

int main() {
      int array[] = {3, 5, 1, 4, 6, 2};
      int done = 0;
      int i;

      while (done == 0) {
            done = 1;
            for (i=0; i<=4; i++) {
                  if (array[i] < array[i+1]) {
                        swap(&array[i], &array[i+1]);
                        done = 0;
                  }
            }
            for (i=5; i>=1; i--) {
                  if (array[i] > array[i-1]) {
                        swap(&array[i], &array[i-1]);
                        done = 0;
                  }
            }
      }
      printf("%d",array[3]);
}

The output of the program is ________.

Consider the following C Program.

#include<stdio.h>
int main() {
        int m = 10;
        int n, n1;
        n = ++m;
        n1 = m++;
        n--;
        --n1;
        n -= n1;
        printf("%d", n);
        return 0;
}

The output of the program is ________.

Consider the following C Program.

#include<stdio.h>
#include<string.h>
int main() {
        char* c = "GATECSIT2017";
        char* p = c;
        printf("%d", (int)strlen(c+2[p]-6[p]-1));
        return 0;
}

The output of the program is ________.