Call stack behavior in Javascript

Introduction

The call stack helps the computer keep track of which function is running and what to do next. It works like a stack of plates, where the last one added is the first one removed.

When you want to understand how functions call each other step-by-step.

When debugging errors that say 'Maximum call stack size exceeded'.

When learning how recursion works in JavaScript.

When you want to know why some functions run before others.

Syntax

Javascript

function functionName() {
  // code here
  anotherFunction();
}

function anotherFunction() {
  // code here
}

functionName();

Each time a function is called, it is added (pushed) to the call stack.

When a function finishes, it is removed (popped) from the call stack.

Examples

Simple function call. The call stack adds 'greet', runs it, then removes it.

Javascript

function greet() {
  console.log('Hello');
}
greet();

Function 'first' calls 'second'. 'second' runs first, then 'first' continues.

Javascript

function first() {
  second();
  console.log('First done');
}
function second() {
  console.log('Second running');
}
first();

Recursive calls add multiple frames to the call stack until the base case is reached.

Javascript

function recursive(count) {
  if (count <= 0) return;
  console.log(count);
  recursive(count - 1);
}
recursive(3);

Even an empty function call adds and removes a frame on the call stack.

Javascript

function empty() {}
empty();

Sample Program

This program shows how the call stack works when functions call each other. You see the order of messages as functions are added and removed from the stack.

Javascript

function firstFunction() {
  console.log('Start firstFunction');
  secondFunction();
  console.log('End firstFunction');
}

function secondFunction() {
  console.log('Start secondFunction');
  thirdFunction();
  console.log('End secondFunction');
}

function thirdFunction() {
  console.log('Inside thirdFunction');
}

console.log('Program start');
firstFunction();
console.log('Program end');

Important Notes

Time complexity depends on the functions called, but call stack operations (push/pop) are very fast.

Space complexity grows with the number of nested function calls on the stack.

Common mistake: forgetting that functions run completely before the caller continues.

Use call stack understanding to debug recursion and function call order.

Summary

The call stack keeps track of function calls in order.

Functions are added to the stack when called and removed when done.

Understanding call stack helps with debugging and learning recursion.

Practice

1. What does the call stack do in JavaScript?

easy

A. Keeps track of function calls in the order they are called

B. Stores variables and their values

C. Manages asynchronous events

D. Handles network requests

Solution

1. Step 1: Understand the role of the call stack

   The call stack tracks which functions are currently running and in what order.

2. Step 2: Differentiate from other JavaScript components

   Variables are stored in memory, asynchronous events are handled by the event loop, and network requests are managed separately.

3. Final Answer:

   Keeps track of function calls in the order they are called -> Option A

4. Quick Check:

   Call stack = function order tracking [OK]

Hint: Call stack = function call order tracker [OK]

Common Mistakes:

• Confusing call stack with event loop
• Thinking call stack stores variables
• Mixing call stack with network handling

2. Which of the following is the correct way to call a function named foo in JavaScript?

easy

A. call foo();

B. function foo();

C. execute foo();

D. foo();

Solution

1. Step 1: Recall JavaScript function call syntax

   Functions are called by writing their name followed by parentheses, like foo();.

2. Step 2: Identify incorrect options

   "call foo();" and "execute foo();" are not valid JavaScript syntax. "function foo();" is a function declaration, not a call.

3. Final Answer:

   foo(); -> Option D

4. Quick Check:

   Function call = name + () [OK]

Hint: Call functions with name and parentheses () [OK]

Common Mistakes:

• Using 'call' keyword incorrectly
• Confusing declaration with call
• Adding extra keywords like 'execute'

3. What will be the output of the following code?

function first() {
  console.log('first');
  second();
  console.log('first again');
}

function second() {
  console.log('second');
}

first();

medium

A. second\nfirst\nfirst again

B. first\nsecond\nfirst again

C. first\nfirst again\nsecond

D. first again\nsecond\nfirst

Solution

1. Step 1: Trace the call stack execution order

   Calling first() prints 'first', then calls second() which prints 'second'. After second() finishes, control returns to first() and prints 'first again'.

2. Step 2: Confirm output sequence

   The output lines are: 'first', 'second', 'first again' in that order.

3. Final Answer:

   first second first again -> Option B

4. Quick Check:

   Call stack order = first, second, first again [OK]

Hint: Follow function calls step-by-step [OK]

Common Mistakes:

• Assuming all logs run before second()
• Mixing order of console logs
• Ignoring return to first() after second()

4. Identify the error in the following code related to call stack behavior:

function a() {
  b();
}

function b() {
  a();
}

a();

medium

A. Function b is not defined

B. Syntax error due to missing semicolons

C. Infinite recursion causing stack overflow

D. No error, code runs fine

Solution

1. Step 1: Analyze function calls and recursion

   Function a() calls b(), and b() calls a() again, creating an endless loop.

2. Step 2: Understand call stack impact

   This infinite mutual recursion causes the call stack to grow until it overflows, leading to a runtime error.

3. Final Answer:

   Infinite recursion causing stack overflow -> Option C

4. Quick Check:

   Mutual recursion without stop = stack overflow [OK]

Hint: Watch for functions calling each other endlessly [OK]

Common Mistakes:

• Thinking missing semicolons cause error
• Assuming functions are undefined
• Believing code runs without error

5. Consider this code:

function factorial(n) {
  if (n === 0) return 1;
  return n * factorial(n - 1);
}

console.log(factorial(3));

How many times is the factorial function added to the call stack during factorial(3) execution?

hard

A. 4 times

B. 6 times

C. 1 time

D. 3 times

Solution

1. Step 1: Trace recursive calls for factorial(3)

   Calls happen for n=3, n=2, n=1, and n=0. Each call adds a new frame to the call stack.

2. Step 2: Count total calls added to the stack

   There are 4 calls total before reaching the base case (n=0), so 4 stack frames are added.

3. Final Answer:

   4 times -> Option A

4. Quick Check:

   Recursive calls = n+1 stack frames [OK]

Hint: Count calls including base case for recursion [OK]

Common Mistakes:

• Counting only n times, missing base case call
• Confusing total calls with return steps
• Assuming single call for recursion