Gate Exam Programming

int get(int n)
{
if n<1 get(n-1);
get(n-3);
return (0);
}

If get(6) is called through main then how many times get() function is called?

Read Solution (Total 4)

Gate Other Question

There is a function f(x), such that
f(-2)=29
f(3)=39
Then,
f(3)=?
There is a full binary tree with 200 leaf nodes then find the number of such nodes who has exactly 2 child nodes.