GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2021 · Set-1
Programming & Data StructuresProgramminghardMCQ2 marks
Consider the following ANSI C program.
c
#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?
Save your progress

Related Programming & Data Structures PYQs

GATE 2021 · Set-1

A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than t…

GATE 2021 · Set-1

Consider the following sequence of operations on an empty stack. push(54); push(52); pop(); push(55); push(62); s = pop(); Conside…

GATE 2021 · Set-1

Consider the following ANSI C function: ```c int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loo…

GATE 2021 · Set-2

Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal …

GATE 2021 · Set-2

Consider the following ANSI C program. ```c #include <stdio.h> int main(){ int arr[4][5]; int i, j; for (i=0; i<4; i++){ …

GATE 2021 · Set-2

Consider a complete binary tree with 7 nodes. Let A denote the set of first 3 elements obtained by performing Breadth-First Search…