4.1.1.15 Role of stack frames in subroutine calls

Question 1

Why do recursive algorithms use stacks?

Answer 1

Stacks are a LIFO data structure, the last iteration of the recursion needs to return the value first, so that it returns the values in the right order.

Question 2

What is the stack frame?

Answer 2

All the locations from the stack allocated for one subroutine call.

Question 3

What could cause stack overflow?

Answer 3

If the number of recursive calls are larger than the allocated space set by the stack (the stack frame)

Question 4

What is stored within the stack frame?

Answer 4

Return addresses - where in the code the program returns to after the subroutine
Parameters of the subroutine
Local variables of the subroutine