Why Stack Exists and What Problems It Solves in DSA C - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why do we use a stack in function calls?

When a program calls a function, why is a stack data structure used to manage these calls?

A Because a stack randomly picks which function to execute next.

B Because a stack helps keep track of the order in which functions are called and ensures the last called function finishes first.

C Because a stack allows functions to run in any order without restrictions.

D Because a stack stores all function results permanently for later use.

💡 Hint

Think about how functions call other functions and then return back.

A stack follows Last In First Out (LIFO) order, which matches how function calls work: the last function called must finish before the previous one continues.

❓ Predict Output

intermediate

Output of stack operations sequence

What is the printed state of the stack after these operations?

DSA C

push(10)
push(20)
pop()
push(30)
push(40)
pop()

A 10 -> 30 -> null

B 10 -> 20 -> 30 -> 40 -> null

C 10 -> 20 -> null

D 30 -> 40 -> null

💡 Hint

Remember pop removes the last pushed item.

After pushing 10 and 20, popping removes 20. Then pushing 30 and 40, popping removes 40. The stack has 10 and 30 left.

🔧 Debug

advanced

Identify the problem solved by using a stack in expression evaluation

Why is a stack used to evaluate expressions like (3 + (2 * 5))?

A To convert numbers into strings for easier calculation.

B To store all numbers permanently for future calculations.

C To randomly select which operation to perform next.

D To keep track of operators and operands in the correct order, especially with nested parentheses.

💡 Hint

Think about how parentheses affect the order of operations.

Stacks help manage operators and operands, especially when expressions have nested parentheses, ensuring correct order of evaluation.

❓ Predict Output

advanced

Stack usage in reversing a string

What is the output after pushing each character of "code" onto a stack and then popping all characters?

DSA C

push('c')
push('o')
push('d')
push('e')
pop()
pop()
pop()
pop()

A "edoc"

B "code"

C "cdeo"

D "odec"

💡 Hint

Stack pops characters in reverse order of pushing.

Pushing characters 'c', 'o', 'd', 'e' then popping all returns them in reverse order: 'e', 'd', 'o', 'c'.

🧠 Conceptual

expert

Why is stack preferred over other data structures for backtracking problems?

In backtracking problems like maze solving, why is a stack the best choice to keep track of paths?

A Because it stores all possible paths permanently for comparison.

B Because it randomly selects the next path to explore.

C Because it allows returning to the most recent decision point quickly, following last-in-first-out order.

D Because it sorts paths by length automatically.

💡 Hint

Think about how backtracking needs to undo recent steps first.

Backtracking requires undoing the most recent choices first, which matches the LIFO behavior of stacks.

Practice

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

easy

A. To store data in random order

B. To keep track of function calls and return addresses

C. To sort numbers quickly

D. To store large amounts of data permanently

Solution

1. Step 1: Understand the purpose of a stack

   A stack stores data in a last-in, first-out order, which is perfect for tracking function calls and returns.

2. Step 2: Identify common uses of stack

   Stacks are mainly used to keep track of function calls, especially in recursion, where the last called function must finish first.

3. Final Answer:

   To keep track of function calls and return addresses -> Option B

4. Quick Check:

   Stack = function call tracking [OK]

Hint: Stack = last-in, first-out for function calls [OK]

Common Mistakes:

• Thinking stack stores data randomly
• Confusing stack with queue
• Assuming stack sorts data

2. Which of the following is the correct way to push an element onto a stack in C?

easy

A. stack[++top] = value;

B. stack[top] = value++;

C. stack[top++] = value;

D. stack[top--] = value;

Solution

1. Step 1: Understand stack push operation

   To push, we first increase the top index, then assign the value at that position.

2. Step 2: Check each option

   stack[++top] = value; increments top before assignment, which is correct. stack[top++] = value; assigns then increments, which may overwrite. stack[top] = value++; increments value, not top. stack[top--] = value; decrements top, which is wrong for push.

3. Final Answer:

   stack[++top] = value; -> Option A

4. Quick Check:

   Push = increment top then assign [OK]

Hint: Push means increment top first, then assign [OK]

Common Mistakes:

• Incrementing after assignment causes overwrite
• Decrementing top on push
• Incrementing value instead of top

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

int stack[3];
int top = -1;
stack[++top] = 10;
stack[++top] = 20;
stack[++top] = 30;
printf("%d", stack[top]);

medium

A. 10

B. 20

C. 30

D. Runtime error

Solution

1. Step 1: Trace stack push operations

   Initially, top = -1. After first push, top=0, stack[0]=10. Second push: top=1, stack[1]=20. Third push: top=2, stack[2]=30.

2. Step 2: Check printed value

   printf prints stack[top], which is stack[2] = 30.

3. Final Answer:

   30 -> Option C

4. Quick Check:

   Last pushed value = 30 [OK]

Hint: Last pushed value is at stack[top] [OK]

Common Mistakes:

• Printing stack[0] instead of stack[top]
• Confusing top index after pushes
• Assuming runtime error without overflow

4. Identify the error in this stack pop function in C:

int pop(int stack[], int *top) {
    if (*top == -1) {
        printf("Stack Underflow\n");
        return -1;
    }
    return stack[*top--];
}

medium

A. Incorrect decrement of top pointer

B. Missing check for stack overflow

C. Returning wrong stack element

D. No error, function is correct

Solution

1. Step 1: Understand pointer decrement in return statement

   The expression stack[*top--] uses post-decrement on *top, but *top-- decrements the pointer, not the value it points to.

2. Step 2: Correct way to decrement top value

   It should be stack[(*top)--] to decrement the value pointed by top after accessing stack.

3. Final Answer:

   Incorrect decrement of top pointer -> Option A

4. Quick Check:

   Use (*top)-- to decrement value, not pointer [OK]

Hint: Use (*top)-- to decrement value, not pointer [OK]

Common Mistakes:

• Using *top-- instead of (*top)--
• Ignoring pointer vs value decrement
• Not checking stack underflow

5. You want to reverse a string using a stack in C. Which approach correctly uses the stack to solve this problem?

hard

A. Use a queue instead of a stack to reverse the string

B. Push characters only if they are vowels, then pop to reverse

C. Pop characters first, then push them back to reverse

D. Push each character of the string onto the stack, then pop all characters to form the reversed string

Solution

1. Step 1: Understand stack reversal logic

   Pushing all characters onto the stack stores them in order. Popping them reverses the order due to last-in, first-out behavior.

2. Step 2: Evaluate options

   Push each character of the string onto the stack, then pop all characters to form the reversed string correctly pushes all characters then pops to reverse. Push characters only if they are vowels, then pop to reverse only pushes vowels, losing other characters. Pop characters first, then push them back to reverse pops before pushing, which is invalid. Use a queue instead of a stack to reverse the string suggests queue, which reverses order differently.

3. Final Answer:

   Push each character of the string onto the stack, then pop all characters to form the reversed string -> Option D

4. Quick Check:

   Stack reversal = push all, then pop all [OK]

Hint: Push all chars, then pop all to reverse [OK]

Common Mistakes:

• Pushing only some characters
• Popping before pushing
• Using queue instead of stack for reversal