Register

How to Solve This Q

• retagged by
382 views

1 Answer

0 votes
0 votes

you can use recursion tree method...

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

Related questions

0 votes
0 votes
2 answers
2
kallu singh asked Aug 12, 2017
504 views
Please explain this Q
Consider the following C program int f1(int n) { if(n == 0 || n == 1) return n; else return (2*f1(n-1) + 3*f1(n-2)); } Consider the program given in above question, f1(8) and f2(8) return the values A 1661 and 1640 B 59 and 59 C 1640 and 1640 D 1640 and 1661
Consider the following C programint f1(int n) { if(n == 0 || n == 1) return n; else return (2*f1(n-1) + 3*f1(n-2)); }Consider the program given in above question, f1(8) a...
User Avatar
0 votes
0 votes
1 answer
3
kallu singh asked Sep 7, 2018
629 views
Solve this Q
Consider the following C code segment int f (int x) { if (x < 1) return 1; else return (f(x-1) + g(x)) } int g (int x) { if (x < 2) return 2; else return (f(x-1) + g(x/2)); } Of the following, which best describes the growth of f(x) as a function of x? (A) Linear (B) Exponential (C) Quadratic (D) Cubic
Consider the following C code segmentint f (int x) { if (x < 1) return 1; else return (f(x-1) + g(x)) } int g (int x) { if (x < 2) return 2; else return (f(x-1) + g(x/2))...
User Avatar
0 votes
0 votes
2 answers
4
Akash Mishra asked Jul 7, 2017
571 views
How do I solve this recursion?
What is the value of F(n, m)? Function F(n, m : integer) : integer; begin if(n <= 0) or (m <= 0) then F:=1 else F := F(n-1, m) + F(n, m-1); end;
What is the value of F(n, m)?Function F(n, m : integer) : integer; begin if(n <= 0) or (m <= 0) then F:=1 else F := F(n-1, m) + F(n, m-1); end;
User Avatar
Link Copied!