#include <stdio.h>
int main() {
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip = arr + 4;
printf("%d\n", ip[1]);
return 0;
}Consider the following C program: ```c void convert(int n) { if (n < 0) printf("%d", n); else { convert(n…
Consider the following C program: ```c #include <stdio.h> int r() { static int num = 7; return num--; } int main() { …
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node. II. The second largest element …
Consider the following C program: ```c #include <stdio.h> int main() { float sum = 0.0, j = 1.0, i = 2.0; while (i / j > …
Consider the following C program: ```c #include <stdio.h> int main() { int a[] = {2, 4, 6, 8, 10}; int i, sum = 0, *b = a…
Consider the following C program: ```c #include <stdio.h> int jumble(int x, int y) { x = 2 * x + y; return x; } int main(…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.