Register

GO Classes 2023 | Weekly Quiz 4 | Question: 20

• retagged by
530 views

3 Answers

3 votes
3 votes

Answer : 642211431136

Here, => means prints.

 

mystery2(-2) => null

mystery2(-1) => null

mystery2(0) => null

mystery2(1) => 1 mystery2(-1) mystery2(-2) 1 => 11

mystery2(2) => 2 mystery2(0) myster2(-1) 2 => 22

mystery2(3) => 3 mystery2(1) myster2(0) 3 => 3113

mystery2(4) => 4 mystery2(2) myster2(1) 4 => 422114

mystery2(5) => 5 mystery2(3) myster2(2) 5 => 53113225

mystery2(6) => 6 mystery2(4) myster2(3) 6 => 642211431136

User Avatar
0 votes
0 votes

Answer is 642211431136

Let the function mystery2() be represented as m() for ease. And printf() be represented as p().

Then we create a recursion tree (as shown).

  • We can directly execute the print statements.(No need to show in recursion tree). This is done here for first print statement of the function.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
3 answers
1
GO Classes asked Mar 26, 2022
587 views
GO Classes 2023 | Weekly Quiz 4 | Question: 21
What will be the output printed by $\text{mystery}3(6)$? void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }
What will be the output printed by $\text{mystery}3(6)$?void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }
User Avatar
5 votes
5 votes
3 answers
3
GO Classes asked Mar 26, 2022
895 views
GO Classes 2023 | Weekly Quiz 4 | Question: 22
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to? int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) + f(n); }
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to?int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n...
User Avatar
9 votes
9 votes
2 answers
4
GO Classes asked Mar 26, 2022
639 views
GO Classes 2023 | Weekly Quiz 4 | Question: 23
Consider the following recursive function. What is $f(0)?$ int f(int x) { if (x > 1000) return x - 4; else return f(f(x+5)); }
Consider the following recursive function. What is $f(0)?$int f(int x) { if (x 1000) return x - 4; else return f(f(x+5)); }
User Avatar
Link Copied!