Consider the following ANSI C program.
The output of the program upon execution is \(\underline{\hspace{2cm}}\).
Consider the following ANSI C program.
The output of the program upon execution is \(\underline{\hspace{2cm}}\).
Show Hint
Correct Answer: 60
Solution and Explanation
Step 1: Understand base conditions.
The function returns \( q \) when both \( x \le 0 \) and \( y \le 0 \).
Step 2: Recursive behavior.
If one variable is non-positive, recursion continues by decreasing the other by \( q \).
If both are positive, the function branches into two recursive calls.
Step 3: Evaluate \( \text{foo}(15,15,10) \).
\[
\text{foo}(15,15,10) = \text{foo}(15,5,10) + \text{foo}(5,15,10)
\]
Each of these further expands until base cases are reached.
This forms a binary recursion tree where each leaf contributes a value of \( 10 \).
Step 4: Count base case occurrences.
The recursion generates exactly 6 base case hits.
Step 5: Compute final result.
\[
\text{Result} = 6 \times 10 = 60
\]
% Final Answer
Final Answer: \[ \boxed{60} \]
Top GATE CS Programming and Data Structures Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- Given N distinct elements in an array, determine the number of comparisons required to find the element which is not the largest:
Consider the following code:
main() { int x = 126, y = 105; { if (x > y) x = x - y; else y = y - x; } while (x != y) printf("%d", x); }- In a binary search tree with the following elements: \( 10, -4, 15, 13, 20, 5, 16, 19 \), the number of edges from node 19 to the root is?
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);
Top GATE CS Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- The Lucas sequence Ln is defined by the recurrence relation: Ln = Ln−1 + Ln−2, for n ≥ 3, with L1 = 1 and L2 = 3. Which one of the options given is TRUE?
- Which of the following fields of IP header is/are always modified by any router before it forwards to IP Packet ?
- Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
- Consider an ethernet segment whose transmission is \(10^8\) bits per second. Maximum segment length \(500\ m\), speed of the provocation media velocity is \(2 × 10^8\) meter per second. What is the minimum frame size in bits ?