6 votes 6 votes 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); } Programming in C goclasses2024-mockgate-11 goclasses numerical-answers programming programming-in-c recursion 2-marks + – GO Classes asked Jan 13 • retagged Jan 13 by Lakshman Bhaiya GO Classes 515 views answer comment Share Follow See 1 comment See all 1 1 comment reply GO Classes Support commented Jan 16 reply Follow Share $ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$ All India Mock Test 2 - Solutions Part 2 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes $\color{Green}\text{Ans: 89}$ Akash 15 answered Jan 14 Akash 15 comment Share Follow See all 2 Comments See all 2 2 Comments reply Viggy_27 commented Jan 14 reply Follow Share A base condition exploration approach could save some time :)) 2 votes 2 votes Akash 15 commented Jan 14 reply Follow Share +1 In exam quick approach is useful and also necessary. ;) But for clear understanding doing analysis also necessary :) 1 votes 1 votes Please log in or register to add a comment.