Call stack behavior in C++ - Step-by-Step Execution

Concept Flow - Call stack behavior

Program starts

↓

Function called

↓

Push frame on stack

↓

Execute function body

↓

Function calls another function?

Yes→Repeat push frame

No↓

Function returns

↓

Pop frame from stack

↓

Return to caller or end program

This flow shows how each function call adds a frame to the stack, runs, then removes the frame when done.

Execution Sample

C++

int add(int a, int b) {
    return a + b;
}

int main() {
    int result = add(2, 3);
    return 0;
}

This code calls add(2, 3), showing how the call stack manages the function call and return.

Execution Table

Step	Action	Call Stack Frames	Top Frame Variables	Output/Return Value
1	Program starts	[]	None	None
2	main() called	[main]	None	None
3	add(2, 3) called inside main	[main, add]	a=2, b=3	None
4	add returns a+b=5	[main]	None	5
5	main stores result=5	[main]	result=5	None
6	main returns 0	[]	None	0
7	Program ends	[]	None	None

💡 Program ends after main returns, call stack is empty.

Variable Tracker

Variable	Start	After Step 3	After Step 4	After Step 5	Final
a	N/A	2	N/A	N/A	N/A
b	N/A	3	N/A	N/A	N/A
result	N/A	N/A	N/A	5	5

Key Moments - 3 Insights

Why does the call stack grow when a function is called?

Each function call creates a new frame on the stack to store its variables and return address, as shown in step 3 of the execution_table.

What happens to the variables of a function after it returns?

The function's stack frame is popped off, so its variables are removed from the stack, as seen in step 4 where add's frame is removed.

Why is the call stack empty after main returns?

Because main is the first function called and the last to return, once it returns, no frames remain on the stack, shown in step 6 and 7.

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what variables are stored in the top stack frame?

A a=2, b=3

B result=5

C None

D a=5, b=0

💡 Hint

Check the 'Top Frame Variables' column at step 3 in the execution_table.

At which step does the add function return its value and its frame is popped?

A Step 2

B Step 5

C Step 4

D Step 6

💡 Hint

Look for when the call stack changes from [main, add] to [main] in the execution_table.

If main called another function before add, how would the call stack look at step 3?

A [main, add]

B [main, other_function, add]

C [main, other_function]

D [add]

💡 Hint

Each function call adds one frame on top; the stack grows with each call.

Concept Snapshot

Call stack stores function calls in order.
Each call adds a frame with variables.
When function returns, frame is removed.
Stack empties after main returns.
Helps track where to return next.

Full Transcript

The call stack is a structure that keeps track of function calls. When the program starts, the stack is empty. Calling main adds its frame. Inside main, calling add pushes add's frame with variables a=2 and b=3. When add returns, its frame is popped, returning 5 to main. Main stores result=5, then returns 0, popping its frame and ending the program. Variables exist only while their function's frame is on the stack. This process ensures the program knows where to return after each call.