GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2020
Programming & Data StructuresProgramminghardNAT2 marks
Consider the following C functions:
c
int fun1(int n) {
    static int i = 0;
    if (n > 0) {
        ++i;
        fun1(n - 1);
    }
    return i;
}

int fun2(int n) {
    static int i = 0;
    if (n > 0) {
        i = i + fun1(n);
        fun2(n - 1);
    }
    return i;
}
The return value of fun2(5) is _______
Save your progress

Related Programming & Data Structures PYQs

GATE 2020

The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder trav…

GATE 2020

What is the worst case time complexity of inserting n^2 elements into an AVL-tree with n elements initially?

GATE 2020

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintaine…

GATE 2020

Consider the following C program: ```c #include <stdio.h> int main() { int a[4][5] = { {1, 2, 3, 4, 5}, {6, 7…

GATE 2020

Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) …

GATE 2020

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]…