Algorithms

Question 42

Consider the following recursive function:

 function fib (1:integer);integer;
 begin
 if (n=0) or (n=1) then fib:=1
 else fib:=fib(n-1) + fib(n-2)
 end;

The above function is run on a computer with a stack of 64 bytes. Assuming that only return address and parameter and passed on the stack, and that an integer value and an address takes 2 bytes each, estimate the maximum value of n for which the stack will not overflow. Give reasons for your answer.

A	Theory Explanation.

AlgorithmsAsymptotic-ComplexityGATE 1994

Correct Answer: A

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments