void count(int n) {
static int d = 1;
printf("%d ", n);
printf("%d ", d);
d++;
if (n > 1) count(n - 1);
printf("%d ", d);
}
void main() {
count(3);
}A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the followi…
Consider the C program: ```c void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; // call t…
Consider the following C program: ```c #include<stdio.h> void mystery(int *ptra, int *ptrb) { int *temp; temp = ptrb; …
The function computes max value in integer array p[] of size n (n >= 1): ```c int max(int *p, int n) { int a = 0, b = n - 1; …
What will be the output of the pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; ```c voi…
An operator delete(i) for a binary heap in an array deletes the item at index i. If the heap tree has depth d, what is the time co…
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.