Why Stack Exists and What Problems It Solves in DSA Javascript - Quick Recap

Recall & Review

beginner

What is a stack in simple terms?

A stack is like a pile of plates where you can only add or remove the top plate. It follows the Last In, First Out (LIFO) rule.

beginner

Why do we need a stack in programming?

Stacks help manage tasks that need to be done in reverse order, like undo actions, function calls, or checking matching brackets.

intermediate

How does a stack solve the problem of function calls in programming?

When functions call other functions, the stack keeps track of where to return after each call, so the program knows the correct order to finish tasks.

intermediate

What problem does a stack solve in expression evaluation?

Stacks help evaluate math expressions by storing operators and operands in the right order, especially when dealing with parentheses and operator precedence.

beginner

Explain the Last In, First Out (LIFO) principle with a real-life example.

Imagine a stack of books. You put a new book on top and when you want a book, you take the top one first. The last book you put is the first you take out.

What does LIFO stand for in the context of a stack?

A Load In, Fast Out

B Last In, Final Output

C List In, First Out

D Last In, First Out

LIFO means the last item added to the stack is the first one to be removed.

Which of these problems is best solved using a stack?

A Undo feature in text editors

B Sorting a list

C Finding the largest number

D Searching in a database

Undo actions require reversing the order of operations, which stacks handle well.

How does a stack help with function calls?

A By storing all variables globally

B By storing the order of calls to return correctly

C By speeding up the function execution

D By preventing recursion

Stacks keep track of where each function should return after finishing.

What happens when you try to remove an item from an empty stack?

A Stack overflow error

B The stack resets

C Stack underflow error

D Nothing happens

Removing from an empty stack causes an underflow error because there is nothing to remove.

Which real-life example best describes a stack?

A A pile of plates

B A queue at a ticket counter

C A bookshelf with books arranged alphabetically

D A list of names in a phone book

A pile of plates is a perfect example of a stack where you add and remove from the top.

Explain why stacks are important in managing function calls in programming.

Think about how the program remembers where to go back after a function finishes.

Describe a real-life situation where a stack-like structure is used and how it helps solve a problem.

Imagine something you add and remove only from the top.

Practice

1. Why do we use a stack data structure in programming?

easy

A. To store data randomly

B. To store data in a first-in, first-out (FIFO) order

C. To manage data in a last-in, first-out (LIFO) order

D. To sort data automatically

Solution

1. Step 1: Understand stack behavior

   A stack stores data so the last item added is the first one removed, called LIFO.

2. Step 2: Compare with other data structures

   Unlike queues (FIFO), stacks focus on reversing order or tracking recent items.

3. Final Answer:

   To manage data in a last-in, first-out (LIFO) order -> Option C

4. Quick Check:

   Stack = LIFO order [OK]

Hint: Stack means last added is first removed [OK]

Common Mistakes:

• Confusing stack with queue (FIFO)
• Thinking stack sorts data automatically
• Assuming stack stores data randomly

2. Which of the following is the correct way to push an element '5' onto a stack named myStack in JavaScript?

easy

A. myStack.add(5);

B. myStack.push(5);

C. myStack.insert(5);

D. myStack.enqueue(5);

Solution

1. Step 1: Recall JavaScript stack method

   JavaScript arrays use push() to add elements at the end, acting as stack push.

2. Step 2: Check other options

   add(), insert(), and enqueue() are not standard array methods for stack push.

3. Final Answer:

   myStack.push(5); -> Option B

4. Quick Check:

   Push method adds element to stack [OK]

Hint: Use push() to add elements to stack in JS [OK]

Common Mistakes:

• Using enqueue which is for queues
• Using add or insert which are not JS array methods
• Confusing push with pop

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

const stack = [];
stack.push(10);
stack.push(20);
const popped = stack.pop();
console.log(popped);
console.log(stack);

medium

A. 20
[10]

B. 10
[20]

C. 20
[20, 10]

D. 10
[10]

Solution

1. Step 1: Trace push operations

   First, 10 is pushed, stack = [10]. Then 20 is pushed, stack = [10, 20].

2. Step 2: Trace pop operation

   Pop removes last element 20, so popped = 20, stack = [10].

3. Final Answer:

   20 [10] -> Option A

4. Quick Check:

   Pop returns last pushed element [OK]

Hint: Pop returns last pushed element, stack shrinks [OK]

Common Mistakes:

• Thinking pop removes first element
• Confusing push and pop order
• Expecting stack to be empty after pop

4. Identify the error in the following code that tries to implement a stack push operation:

let stack = [];
function pushToStack(element) {
  stack.add(element);
}

medium

A. Function name should be pushStack instead of pushToStack

B. Stack should be declared with const instead of let

C. Missing return statement in function

D. Using add() method which does not exist on arrays

Solution

1. Step 1: Check array methods for adding elements

   JavaScript arrays use push(), not add(), to add elements.

2. Step 2: Verify other options

   Using let is fine; return is not needed for push; function name is valid.

3. Final Answer:

   Using add() method which does not exist on arrays -> Option D

4. Quick Check:

   Use push() to add elements to array [OK]

Hint: Arrays use push(), not add() [OK]

Common Mistakes:

• Using add() instead of push()
• Thinking return is needed for push
• Confusing variable declaration keywords

5. You want to reverse a string using a stack in JavaScript. Which approach correctly uses a stack to reverse the string "hello"?

hard

A. Push each character onto stack, then pop all to build reversed string

B. Push characters in reverse order, then pop to get original string

C. Use stack to sort characters alphabetically

D. Push only vowels onto stack, then pop to reverse string

Solution

1. Step 1: Understand stack reversal logic

   Pushing characters in original order and popping reverses their order, reversing the string.

2. Step 2: Evaluate other options

   Push characters in reverse order, then pop to get original string reverses twice, giving original string; A sorts, not reverses; D only reverses vowels, not full string.

3. Final Answer:

   Push each character onto stack, then pop all to build reversed string -> Option A

4. Quick Check:

   Stack reverses order by LIFO [OK]

Hint: Push original order, pop to reverse [OK]

Common Mistakes:

• Pushing characters in reverse order first
• Using stack to sort instead of reverse
• Only pushing vowels instead of all characters