1
GATE CSE 2020
Numerical
+1
-0.33
Consider the following C program.

#include < stdio.h >
int main () {
int a [4] [5] = {{1, 2, 3, 4, 5},
{6, 7, 8, 9, 10},
{11, 12, 13, 14, 15},
{16, 17, 18, 19, 20}};
printf (“%d\n”, *(*(a+**a+2) +3));
return (0);
}

The output of the program is _______.
2
GATE CSE 2005
+1
-0.3
A program P reads in 500 integers in the range [0, 100] representing the cores of 500 students. It then print the frequency of each score above 50. What would be the best way for P to store the frequencies?
A
An array of 50 numbers
B
An array of 100 numbers
C
An array of 500 numbers
D
A dynamically allocated array of 550 numbers
3
GATE CSE 2004
+1
-0.3
A single array A[1..MAXSIZE] is used to implement two stacks, The two stacks grow from opposite ends of the array. Variables top1 and top2 (top1 < top2) point to the location of the topmost element in each of the stacks, If the space is to be used efficiently, the condition for "stack full" is
A
(top 1 = MAXSIZE/2) AND (top 2 = MAXSIZE/2 + 1)
B
top 1 + top 2 = MAXSIZE
C
(top 1 = MAXSIZE/2) or (top 2 = MAXSIZE)
D
top 1 = top 2 - 1
4
GATE CSE 2000
+1
-0.3
An n $$\times$$ n array v is defined as follows V [i, j] = i - j for all i, j, $$1 \le i \le n,\,1 \le j \le n$$ The sum of the elements of the array v is
A
0
B
n - 1
C
$${n^2} - 3n + 2$$
D
$${n^2}(n + 1)/2$$
GATE CSE Subjects
EXAM MAP
Medical
NEET