Stack overflow concept in Javascript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a stack overflow in programming?

A stack overflow happens when a program uses more memory on the call stack than is available. This usually occurs due to too many nested function calls or infinite recursion.

beginner

How does recursion relate to stack overflow?

Recursion is when a function calls itself. If the recursion never stops or stops too late, it keeps adding calls to the stack, which can cause a stack overflow.

beginner

What is the call stack in JavaScript?

The call stack is a place where JavaScript keeps track of function calls. Each time a function runs, it is added to the stack. When it finishes, it is removed.

intermediate

What happens when a stack overflow occurs in JavaScript?

When a stack overflow happens, JavaScript throws a 'RangeError: Maximum call stack size exceeded' error and stops running the current execution context.

intermediate

How can you prevent stack overflow caused by recursion?

You can prevent stack overflow by making sure recursive functions have a base case that stops the recursion, or by using loops instead of recursion.

What causes a stack overflow in JavaScript?

A Running out of disk space

B Using too many variables

C Too many nested function calls or infinite recursion

D Syntax errors in code

A stack overflow happens when the call stack exceeds its limit due to too many nested calls or infinite recursion.

What error message does JavaScript show when a stack overflow occurs?

A RangeError: Maximum call stack size exceeded

B TypeError: undefined is not a function

C ReferenceError: variable is not defined

D SyntaxError: Unexpected token

JavaScript throws a RangeError with the message 'Maximum call stack size exceeded' when a stack overflow happens.

Which of these can help avoid stack overflow in recursive functions?

A Adding a base case to stop recursion

B Removing all function calls

C Using global variables

D Calling functions asynchronously

A base case stops recursion from continuing forever, preventing stack overflow.

What is the call stack used for in JavaScript?

A Storing variables

B Managing network requests

C Saving files

D Tracking function calls

The call stack keeps track of which functions are running and in what order.

If a recursive function never reaches a base case, what will happen?

A The program will run faster

B A stack overflow error will occur

C The program will stop immediately

D The function will return undefined

Without a base case, recursion continues indefinitely, causing a stack overflow.

Explain what a stack overflow is and why it happens in JavaScript.

Think about how functions are added and removed from the call stack.

Describe how you can prevent stack overflow when writing recursive functions.

Focus on controlling when recursion ends.