#include <stdio.h>
int main() {
int m = 10;
int n, n1;
n = ++m;
n1 = m++;
n--;
--n1;
n -= n1;
printf("%d", n);
return 0;
}Match the following. | List I | List II | | --- | --- | | (P) static char var; | (i) Sequence of memory locations to store addres…
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing…
Consider the following function implemented in C: ```c void printxy(int x, int y) { int *ptr; x = 0; ptr = &x; y …
The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order travers…
Consider the C program fragment below: ```c while (r >= y) { r = r - y; q = q + 1; } ``` Which of the following conditions…
Consider the following snippet of a C program. Assume swap(&x, &y) exchanges contents of x and y. ```c int main() { int array…
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.