Consider the following recursive function: function fib (n: integer): integer;…

PYQ GATE 1994

Consider the following recursive function:

function fib (n: 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 are 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.

Attempted by 2 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…