Why Stack Exists and What Problems It Solves in DSA C# - 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 Last In, First Out (LIFO) order.

beginner

Why do we need a stack data structure?

We need a stack to keep track of things in order where the last thing added is the first to be used or removed, like undo actions or function calls.

beginner

Name a common problem that a stack helps solve.

Stacks help solve problems like reversing data, checking balanced parentheses in code, and managing function calls in programming.

intermediate

How does a stack help in function calls?

When a function calls another, the current function is paused and saved on the stack. After the called function finishes, the saved function resumes, ensuring correct order.

beginner

What does LIFO mean and how does it relate to stacks?

LIFO means Last In, First Out. It means the last item added to the stack is the first one to be removed, just like a stack of books.

What order does a stack follow?

A Last In, First Out (LIFO)

B First In, First Out (FIFO)

C Random Order

D Sorted Order

A stack follows Last In, First Out (LIFO) order, meaning the last item added is the first removed.

Which problem is best solved using a stack?

A Finding the shortest path

B Checking balanced parentheses

C Sorting numbers

D Searching in a list

Stacks are perfect for checking balanced parentheses because they track opening and closing pairs in order.

What happens when a function calls another function in terms of stack?

A The current function is saved on the stack

B The current function is deleted

C The stack is cleared

D The called function is ignored

The current function is saved on the stack so it can resume after the called function finishes.

Which real-life example best represents a stack?

A A random pile of clothes

B A queue at a ticket counter

C A bookshelf sorted by height

D A pile of plates

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

Why can't we access items in the middle of a stack directly?

A Because stacks are random

B Because stacks are sorted

C Because only the top item is accessible

D Because stacks are queues

Stacks only allow access to the top item, so you must remove items above to reach the middle.

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

Think about how functions pause and resume.

Describe a real-life situation where a stack-like structure helps solve a problem.

Think about things you add and remove in reverse order.

Practice

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

easy

A. To keep track of function calls and return in the correct order

B. To store data in random order for quick access

C. To sort numbers in ascending order automatically

D. To store large amounts of data permanently

Solution

1. Step 1: Understand the purpose of a stack

   A stack stores items in a last-in, first-out order, which matches how function calls return in programming.

2. Step 2: Match stack use to function call behavior

   When functions call other functions, the last called function must finish first, so a stack helps keep track of this order.

3. Final Answer:

   To keep track of function calls and return in the correct order -> Option A

4. Quick Check:

   Stack = function call tracking [OK]

Hint: Stack follows last-in, first-out like undo actions [OK]

Common Mistakes:

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

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

easy

A. stack.Add(item);

B. stack.Insert(item);

C. stack.Push(item);

D. stack.Enqueue(item);

Solution

1. Step 1: Recall stack method names in C#

   The Stack class in C# uses Push() to add an item on top.

2. Step 2: Identify incorrect methods

   Add() and Insert() are not stack methods; Enqueue() is for queues.

3. Final Answer:

   stack.Push(item); -> Option C

4. Quick Check:

   Push adds item to stack [OK]

Hint: Use Push() to add, Pop() to remove from stack [OK]

Common Mistakes:

• Using Add() which is for lists
• Using Enqueue() which is for queues
• Confusing Insert() with stack methods

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

Stack<int> stack = new Stack<int>();
stack.Push(10);
stack.Push(20);
stack.Push(30);
int top = stack.Pop();
Console.WriteLine(top);

medium

A. 30

B. 20

C. Error

D. 10

Solution

1. Step 1: Trace the stack operations

   Items pushed in order: 10, then 20, then 30. Stack top is 30.

2. Step 2: Pop removes and returns top item

   Pop() removes 30 and returns it, so top = 30.

3. Final Answer:

   30 -> Option A

4. Quick Check:

   Last pushed item popped = 30 [OK]

Hint: Pop() returns last pushed item [OK]

Common Mistakes:

• Thinking Pop() returns first pushed item
• Confusing Push() and Pop() order
• Expecting error due to missing code

4. The following code tries to pop an item from an empty stack. What is the problem?

Stack<string> stack = new Stack<string>();
string item = stack.Pop();
Console.WriteLine(item);

medium

A. It will print null

B. It will throw an InvalidOperationException

C. It will print an empty string

D. It will compile error

Solution

1. Step 1: Understand Pop() on empty stack behavior

   Pop() on an empty stack throws InvalidOperationException in C#.

2. Step 2: Check code behavior

   Since stack is empty, calling Pop() causes runtime exception, not printing anything.

3. Final Answer:

   It will throw an InvalidOperationException -> Option B

4. Quick Check:

   Pop empty stack = exception [OK]

Hint: Pop() on empty stack throws exception [OK]

Common Mistakes:

• Expecting null or empty string output
• Thinking code won't compile
• Ignoring runtime exceptions

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

hard

A. Use stack to sort characters alphabetically

B. Push all characters, then push them again to reverse

C. Pop characters first, then push to reverse

D. Push each character, then pop all to build reversed string

Solution

1. Step 1: Understand stack reversal logic

   Pushing characters in order and popping them reverses the order because stack is last-in, first-out.

2. Step 2: Identify correct approach

   Push each character of "hello" then pop all to get "olleh". Other options do not reverse correctly.

3. Final Answer:

   Push each character, then pop all to build reversed string -> Option D

4. Quick Check:

   Stack reversal = push then pop [OK]

Hint: Push then pop characters to reverse string [OK]

Common Mistakes:

• Pushing twice without popping
• Popping before pushing
• Using stack to sort instead of reverse